摘要
研究了变换图G^(++-)的圈边连通性问题,利用枚举分析法获得了变换图G^(++-)是圈可分图的充要条件.进一步得到变换图G^(++-)的圈边连通度的界.
The cyclic edge-connectivity of transformation graph G^＋＋- had been considered. Based on the enumeration methods, the sufficient and essential condition of the transformation graph G^＋＋- to be connected and cyclically separated was obtained. The cyclic edge-connectivity＇s upper and lower bounds of trans- formation graph G^＋＋- has been given.
出处
《兰州大学学报（自然科学版）》
CAS
CSCD
北大核心
2016年第3期393-395,404,共4页
Journal of Lanzhou University(Natural Sciences)
基金
Supported by the National Natural Science Foundation of China(61304057,11471105)
Youth Project of Education Department of Hubei Province(Q20142501)
关键词
变换图
连通性
圈边连通性
transformation graph
connectivity
cyclic edge-connectivity
