TY - JOUR
T1 - On the connectivity of cayley graphs
AU - Imrich, Wilfried
PY - 1979/6
Y1 - 1979/6
N2 - It 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.
AB - It 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.
UR - http://www.scopus.com/inward/record.url?scp=0039039198&partnerID=8YFLogxK
U2 - 10.1016/0095-8956(79)90007-8
DO - 10.1016/0095-8956(79)90007-8
M3 - Article
AN - SCOPUS:0039039198
SN - 0095-8956
VL - 26.1979
SP - 323
EP - 326
JO - Journal of Combinatorial Theory, Series B
JF - Journal of Combinatorial Theory, Series B
IS - 3
ER -