研究了变换图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.