二部图λ4-最优性和超级性的范型条件
A FAN -TYPE CONDITION FOR A BIPARTITE GRAPH TO BE λ4 - OPTIMAL AND SUPER-λ4
摘要
作者给出了二部图是λ4-最优的和超级-λ4的范型条件,而且给出例子说明其独立性.这些结果在网络可靠性分析中有一定应用.
The authors present a Fan - type condition for a bipartite graph to be λ4 - optimal and super - λ4, and give some examples to show that the results are independent of others. These results have some applications in analysis of network reliability.
出处
《山东师范大学学报（自然科学版）》
CAS
2012年第1期7-11,共5页
Journal of Shandong Normal University(Natural Science)
基金
国家自然科学基金资助项目（10901097）
山东省自然科学基金资助项目（ZR2010AQ003）
山东省高等学校科技计划项目（J10LA11）.
参考文献9
-
1Bollobas B. Modem Graph Theory [ M ]. New York : Springer - Verlag, 1998.
-
2Esfahanian A H, Hakimi S L. On computing a conditional edge connectivity of a graph [ J ]. Inf Process Letter, 1988,27 : 195 - 199.
-
3Esfahanian A H. Generalized measures of fault tolerance with application to N- cube networks [ J ]. IEEE Trans Comput, 1989,38:1586 -1591.
-
4Yuan J, Liu A X, Wang S Y. Sufficient conditions for bipartite graphs to be super - k - restricted edge connected [ J ]. Discrete Math,2009,309 (9) : 2886 - 2896.
-
5Shang L,Zhang H P. Degree conditions for graphs to be A3 -optimal and super- A3 [J]. Discrete Math,2009,309(10) :3336 -3345.
-
6高敬振,周宏强.图是λ_3-最优和超级-λ_3的范型条件[J].科学技术与工程,2010,10(6):1327-1332. 被引量：1
-
7孟祥军,高敬振.图的λ_4最优性和超级性的度条件[J].山东科学,2010,23(2):1-7. 被引量：1
-
8Ou J P. 4 - restricted edge cut of graphs[ J]. Australas J Combin ,2004,30 : 103 - 112.
-
9Ou J P. A bound on 4 - restricted edge connectivity of graphs [ J ]. Discrete Math,2007,307 ( 19 -20) :2429 -2437.
二级参考文献20
-
1高敬振,陈亮.图是λ4-最优的一个充分条件[J].山东师范大学学报（自然科学版）,2009,24(2):7-9. 被引量：1
-
2Fabrega J, Fiol M A. On the extraconnectivity of graphs. Discrete Math, 1996 ; 155:49-57.
-
3Meng J X, Ji Y H. On a kind of restricted edge connectivity of graphs. Discrete Math, 2003 ; 260:239-248.
-
4Ou J P. Restricted edge connectivity and network reliability. Doctoral Dissertation, Xiamen Univers-ity,2003.
-
5Esfahanian A H, Hakimi S L. On computing a conditional edge connectivity of a graph. Inf Process Letter, 1988 ;27 : 195-199.
-
6Bonsma P, Ueffing N, Volkmann L. Edge-cuts leaving components of order at least three. Discrete Math,2002 ;256:431-439.
-
7Dirac G A. Some theorems on abstract graphs. Proc London Math SOc, 1952 ;2:69-81.
-
8Ore O. Arc coverings of graphs. Ann Mat Pura Appl,1961 ;55:315- 321.
-
9Fan G H. New sufficient conditions for cycles in graphs. J Combin Theory Set B, 1984 ;37:221-227.
-
10Shang L, Zhang H P. Sufficient conditions for graphs to be λ' -optimal and super- λ. Networks,2007 ;49(3 ) :234-242.
