Uniform cyclic edge connectivity in cubic graphs
Uniform cyclic edge connectivity in cubic graphs
复制标题
三次图中的均匀循环边连通性
DOI：
--
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
B. Jackson
中科院分区：
文献类型：
--
作者：
R. Aldred;D. Holton;B. Jackson
循环k边连通且具有每条边都属于某个循环k边割的进一步性质的立方图称为均匀循环k边连通(U(k))。我们对 U(5) 图进行分类，并表明所有循环 5 边连通的立方图都可以通过一系列定义的操作从 U(5) 图的有限小集合生成。
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.