图是超级-λ′的充分条件被引量：1

下载PDF

导出

摘要设G=（V，E）是有限简单无向图．如果G的每个最小限制边割都孤立出一条边，则称G是超级-λ′的．笔者在一定意义上改进了文献给出的图为超级-λ′的一个充分条件．

作者高敬振杨莹莹

机构地区山东师范大学数学科学学院

出处《山东师范大学学报（自然科学版）》 CAS 2010年第1期153-155,共3页 Journal of Shandong Normal University(Natural Science)

基金国家自然科学基金资助项目（10901097,30630073）.

关键词图限制边连通度超级-λ′

参考文献9

1Provan J S, Ball M O. The complexity of counting cuts and of computing the probability that a graph is connected [ J ]. SIAM J Comput, 1983,12: 777 - 788.
2Esfahanian A H, Hakimi S L. On computing a conditional edge connectivity of a graph[J]. Inf Process Letter, 1988,27:195 - 199.
3Meng J X, Ji Y H. On a kind of restricted edge connectivity of graphs [ J ]. Discrete Math, 2002,117:183 -193.
4Wang M, Li Q. Conditional edge connectivity properties, reliabiltiy comparisons and transitivity of graphs [ J ]. Discrete Math,2002,258:205 - 214.
5Hellwig A, Volkmann L. Sufficient conditions for λ' -optimality in graphs of diameter 2[J]. Discrete Math,2004,283:113 - 120.
6Ou J P, Zhang F. Super restricted edge connectivity of regular graphs[J]. Graphs Combin,2005 ,21:459 -467.
7Shang L, Zhang H P. Sufficient conditions for graphs to beλ' -optimal and super-λ'[ J ]. Networks,2007,10:234 -242.
8陈亮,高敬振.图的λ_3最优性的充分条件[J].山东师范大学学报（自然科学版）,2008,23(3):1-4. 被引量：6
9高敬振,蔡俊青.图是超级λ_k-连通(k=4,5)的一个Ore型充分条件[J].山东师范大学学报（自然科学版）,2008,23(4):1-3. 被引量：3

1WANG Yingqian LI Qiao.Upper bound of the third edge-connectivity of graphs[J].Science China Mathematics,2005,48(3):360-371. 被引量：12
2王应前.图的三阶边连通度的优化问题[J].中国科学（A辑）,2006,36(4):369-377. 被引量：5
3Provan J S, Ball M O. The complexity of counting cuts and of computing the probability that a graph is connected[ J] .SIAM J Comput, 1983,12:777 - 788
4Bauer D, Boesch F,Suffel C,et al. On the validity of a reduction of reliable network design to a graph extremal problem[ J]. IEEE Tram Circuits System, 1989,34:1 579 - 1 581
5Esfahanian A, Hakimi S.On computing a conditional edge connectivity of a graph[J] .Info Process Lett, 1988,27:195 - 199
6Zhang Z, Yuan J J.A proof of an inequality concerning k- restricted edge connectivity[J] .Discrete Math,2005,304:128- 134
7Zhang Z, Yuan J J.A proof of an inequality concerning k-restricted edge connectivity[J] .Discrete Math,2005,304:128- 134
8Fiol M A. On super - edge - connected digraphs and bipartite digraphs[J].J Graph Theory, 1992,16(6) :545 -555
9Provan J S,Ball M O.The complexity of counting cuts and of computing the probability that a graph is connected[J] .SIAM J Comput, 1983 ,12 : 777 -788
10Esfahanian A H, Hakimi S L. On computing a conditional edge connectivity of a graph[J]. Inf Process Letter, 1988,27:195 - 199

1Bollobas B. Modem Graph Theory[ M ]. New York : Springer - Vedag, 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.
4Hellwig A, Volkmann L. Sufficient conditions for graphs to be λ' - optimal, super - edge - connected, and maximally edge - connected [ J ]. J Graph Theory,2005,48 : 228 - 246.
5Hellwig A, Volkmann L. Sufficient conditions for λ' - optimality in graphs of diameter 2 [ J]. Discrete Math,2004,283 : 113 - 120.
6Shang L, Zhang H P. Sufficient conditions for graphs to be λ' -optimal and super- λ'[ J ]. Networks,2007,49 (3) :234 -242.

山东师范大学学报（自然科学版）

2010年第1期

内容加载中请稍等...