全图的圈连通度(英文)Cyclic Connectivity of Total Graph
刘振华,黄晓晖
摘要(Abstract)：
对于一个图G,它的一个圈边割是一个边集,将该边集去掉之后能够分离出两个圈.如果G有一个圈边割则称G是圈可分离图.设G是一个圈可分离图,其圈边连通度cλ(G)是G的最小圈边割的基数.圈点割和圈点连通度cκ(G)可以类似定义.本文给出了全图T(G)的圈边连通度和圈点连通度的上界和下界.
关键词(KeyWords)： 全图;圈边连通度;圈点连通度
基金项目(Foundation): supported by NSFC(10971255);; the Key Project of Chinese Ministry of Education(208161);; the Program for New Century Excellent Talents in University,and The Project-sponsored by SRF for ROCS,SEM
作者(Author): 刘振华,黄晓晖
参考文献(References)：
- [1]Bondy J A,Murty U S R.Graph Theory[M].New York:Springer,2008.
- [2]Plummer M D.On the cyclic connectivity of planar graphs[J].Lecture Notes in Math,1972,303:235-242.
- [3]Robertson N.Minimal cyclic-4-connected graphs[J].Trans Amer Math,1984,284:665-684.
- [4]Lovasz L.On graphs not containing independent circuits[J].Mat Lapole,1965,16:289-299(in Hungarian).
- [5]Bollobas B.Extremal Graph Theory[M].London:Academic Press INC,1978,111.
- [6]Wang B,Zhang Z.On cyclic edge-connectivity of transitive graphs[J].Discrete Mathematics,2009,309:4555-4563.
- [7]Robert L,Lowell W.Line graphs and line digraphs[M].London:Academic press,1978,271-305.