CONNECTIVITY OF CAYLEY GRAPHS

被引：8

作者：

IMRICH, W

机构：

[1] Institute of Applied Mathematics, A-8700 Leoben, Montanuniversität Leoben

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1979年 / 26卷 / 03期

关键词：

D O I：

10.1016/0095-8956(79)90007-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. © 1979.

引用

页码：323 / 326

页数：4