On the connectivity of cayley graphs |
| |
| Authors: | Wilfried Imrich |
| |
| Institution: | Institute of Applied Mathematics, Montanuniversität Leoben, A-8700 Leoben, Austria |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
