ON THE EXISTENCE OF THE h-RESTRICTED EDGE CONNECTIVITY OF A GRAPH

摘要

［1］Harary F. Graph theory [M]. Reading, MA: Addison-Wesley, 1972.［2］Bondy J A, Murty U S R. Graph theory with applications [M]. London: Macmillan, 1976.［3］Harary F. Conditional connectivity [J]. Networks, 1983, 14: 355～366.［4］Fábrega J, Fiol M A. On the extraconnectivity of graphs [J]. Discrete Math, 1998, 155: 49～57.［5］Esfahanian A, Hakimi S. On computing a conditional edge connectivity of a graph [J]. Info Process Lett, 1988, 27: 195～199.［6］Esfahanian A. Generalized measures of fault tolerance with application to N-cube networks [J]. IEEE Trans Comput, 1989, 38(11): 1586～1591.［7］Li Qiaoliang, Li Qiao. Reliability analysis of circulant graphs [J]. Networks, 1998, 31: 61～65.［8］Li Qiaoliang, Li Qiao. Super edge connectivity properties of connected edge symmetric graphs [J]. Networks, 1999 33: 157～159.［9］王应前,李乔.直径为2的图的超级边连通性质[J].上海交通大学学报,1999,33(6)： 646～649.［10］王应前,李乔.图是超级限制性边连通的一个Ore型充分条件[J].上海交通大学学报,2001,35(8)：1253～1255.［11］Wang Ying-qian, Li Qiao. A sufficient condition for the equality between the restricted edge-connectivity and minimum edge-degree of graphs [J]. Appl Math J Chinese Univ, 2001, 16(4) (accepted).