A graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adjacent with one vertex. In this paper we prove for any r-regular graph of diameter D and odd girth g that if D≤g−2, then the graph is super-κ when g≥5 and a complete graph otherwise
AbstractFor a connected graph G, the rth extraconnectivity κr(G) is defined as the minimum cardinali...
AbstractA connected digraph is said to be superconnected if it is maximally connected and every mini...
A (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs with girth...
AbstractA graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vert...
A graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adj...
AbstractA graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vert...
A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) i...
A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) i...
A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) i...
AbstractKrishnamoorthy et al. [Minimum order graphs with specified diameter, connectivity and regula...
AbstractThe restricted connectivity κ′(G) of a connected graph G is defined as the minimum cardinali...
AbstractA maximally connected graph of minimum degree δ is said to be superconnected (for short supe...
"Discrete Mathemetics Top Cited Article 2005-2010"The restricted connectivity κ′(G)κ′(G) of a connec...
"Discrete Mathemetics Top Cited Article 2005-2010"The restricted connectivity κ′(G)κ′(G) of a connec...
AbstractA maximally connected digraph G is said to be super-κ if all its minimum disconnecting sets ...
AbstractFor a connected graph G, the rth extraconnectivity κr(G) is defined as the minimum cardinali...
AbstractA connected digraph is said to be superconnected if it is maximally connected and every mini...
A (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs with girth...
AbstractA graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vert...
A graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adj...
AbstractA graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vert...
A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) i...
A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) i...
A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) i...
AbstractKrishnamoorthy et al. [Minimum order graphs with specified diameter, connectivity and regula...
AbstractThe restricted connectivity κ′(G) of a connected graph G is defined as the minimum cardinali...
AbstractA maximally connected graph of minimum degree δ is said to be superconnected (for short supe...
"Discrete Mathemetics Top Cited Article 2005-2010"The restricted connectivity κ′(G)κ′(G) of a connec...
"Discrete Mathemetics Top Cited Article 2005-2010"The restricted connectivity κ′(G)κ′(G) of a connec...
AbstractA maximally connected digraph G is said to be super-κ if all its minimum disconnecting sets ...
AbstractFor a connected graph G, the rth extraconnectivity κr(G) is defined as the minimum cardinali...
AbstractA connected digraph is said to be superconnected if it is maximally connected and every mini...
A (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs with girth...
DOI
Add to ORKG