AbstractIt has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is greatest possible. The main Theorem of this paper weakens the condition of edge transitivity and is used to show that the connectivity of the graph of the assignment polytope is equal to its degree, thereby proving a conjecture of Balinski and Russakoff
A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively up...
AbstractIt is shown that if G is a graph of order p ≥ 2 such that deg u + deg v ≥ p − 1 for all pair...
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectiv...
AbstractIt has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is...
AbstractThe conditions imposed by edge-transitivity and vertex-transitivity on the connectivity of s...
We prove that the atom of a Cayley diagraph which contains the unity is a subgroup. As an applicatio...
AbstractIn this paper, bounds for the edge connectivity of m-Cayley graphs are found, and also sever...
AbstractA graph G is said to be semi-hyper-connected if the removal of every minimum cut of G create...
. Hamidoune's connectivity results [11] for hierarchical Cayley digraphs are extended to Cayley...
AbstractA graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph...
AbstractThe ith conditional edge-connectivity λi for a (simple) graph G is the minimum cardinality o...
Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph ...
AbstractA graph G is said to be super-connected if any minimum cut of G isolates a vertex. In a prev...
For the notion of neighbor-connectivity in graphs whenever a vertex is subverted the entire closed n...
Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (suffic...
A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively up...
AbstractIt is shown that if G is a graph of order p ≥ 2 such that deg u + deg v ≥ p − 1 for all pair...
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectiv...
AbstractIt has been shown by M. E. Watkins that the connectivity of edge transitive finite graphs is...
AbstractThe conditions imposed by edge-transitivity and vertex-transitivity on the connectivity of s...
We prove that the atom of a Cayley diagraph which contains the unity is a subgroup. As an applicatio...
AbstractIn this paper, bounds for the edge connectivity of m-Cayley graphs are found, and also sever...
AbstractA graph G is said to be semi-hyper-connected if the removal of every minimum cut of G create...
. Hamidoune's connectivity results [11] for hierarchical Cayley digraphs are extended to Cayley...
AbstractA graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph...
AbstractThe ith conditional edge-connectivity λi for a (simple) graph G is the minimum cardinality o...
Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph ...
AbstractA graph G is said to be super-connected if any minimum cut of G isolates a vertex. In a prev...
For the notion of neighbor-connectivity in graphs whenever a vertex is subverted the entire closed n...
Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (suffic...
A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively up...
AbstractIt is shown that if G is a graph of order p ≥ 2 such that deg u + deg v ≥ p − 1 for all pair...
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectiv...
DOI
Add to ORKG