Add to ORKGA maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) if all disconnecting sets of cardinality δ are the neighborhood of some vertex of degree δ. Sufficient conditions on the diameter to guarantee that a graph of odd girth g and even girth h ≥ g + 3 is super-κ are stated. Also polarity graphs are shown to be super-κ
AbstractA connected digraph is said to be superconnected if it is maximally connected and every mini...
AbstractA graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vert...
AbstractFor a connected graph G, the restricted edge-connectivity λ′(G) is defined as the minimum ca...
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...
AbstractA maximally connected graph of minimum degree δ is said to be superconnected (for short supe...
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 graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adj...
AbstractThe restricted connectivity κ′(G) of a connected graph G is defined as the minimum cardinali...
AbstractA maximally connected digraph G is said to be super-κ if all its minimum disconnecting sets ...
"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...
AbstractLet G=(V, A) be a digraph on n vertices with maximum degree Δ and diameter D, so that n⩽n(Δ,...
In this paper, first we prove that any graph G is 2-connected if diam(G)≤g−1 for even girth g, and f...
AbstractA connected digraph is said to be superconnected if it is maximally connected and every mini...
AbstractA graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vert...
AbstractFor a connected graph G, the restricted edge-connectivity λ′(G) is defined as the minimum ca...
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...
AbstractA maximally connected graph of minimum degree δ is said to be superconnected (for short supe...
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 graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vertices adj...
AbstractThe restricted connectivity κ′(G) of a connected graph G is defined as the minimum cardinali...
AbstractA maximally connected digraph G is said to be super-κ if all its minimum disconnecting sets ...
"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...
AbstractLet G=(V, A) be a digraph on n vertices with maximum degree Δ and diameter D, so that n⩽n(Δ,...
In this paper, first we prove that any graph G is 2-connected if diam(G)≤g−1 for even girth g, and f...
AbstractA connected digraph is said to be superconnected if it is maximally connected and every mini...
AbstractA graph is superconnected, for short super-κ, if all minimum vertex-cuts consist of the vert...
AbstractFor a connected graph G, the restricted edge-connectivity λ′(G) is defined as the minimum ca...