Uniform cyclic edge connectivity in cubic graphs |
| |
| Authors: | R E L Aldred D A Holton Bill Jackson |
| |
| Institution: | (1) Department of Mathematics and Statistics, University of Otago, P.O. Box 56, Dunedin, New Zealand;(2) Department of Mathematics, Goldsmith College, University of London, London, England |
| |
| Abstract: | A cubic graph which is cyclicallyk-edge connected and has the further property that every edge belongs to some cyclick-edge cut is called uniformly cyclicallyk-edge connected(U(k)). We classify theU(5) graphs and show that all cyclically 5-edge connected cubic graphs can be generated from a small finite set ofU(5) graphs by a sequence of defined operations.MATHDAHCOTAGE.AC.NZ |
| |
| Keywords: | 05 C 40 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
