期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

图的λ_k最优性和超级性(k=2,3)的邻域交与边度条件 被引量：2

Intersection of Neighborhoods and Edge-Degree Conditions of λ_k-Optimal and Super-λ_k(k=2,3) Graphs
下载PDF
导出
摘要 本文给出了图的λk最优性和超级性(k=2,3)的用邻域交与边度表示的充分条件. This paper presents the sufficient conditions of λk-optimal and super-λk （ k = 2,3 ） graphs, which can be represented with intersection of neighborhood and edge-degree.
作者 杨莹莹 高敬振 李鑫
机构地区 山东师范大学数学科学学院
出处 《山东科学》 CAS 2010年第1期15-19,27,共6页 Shandong Science
关键词 k阶限制边连通度 λk-最优图 超级-λk图 邻域交 最小边度 k-restricted edge connectivity λ k-optimal graph super-λk graph intersection of neighborhoods minimum edge-degree
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献7

  • 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.
  • 3HELLWIG A, VOLKMANN L. Sufficient Conditions for λ'-optimality in Graphs of Diameter 2 [ J]. Discrete Math,2004,283 : 113 - 120.
  • 4SHANG L, ZHANG H P. Sufficient Conditions for Graphs to be λ'-optimal and Super-λ' [ J ]. Networks,2007,49:234 -242.
  • 5] SHANG L, ZHANG H P. Degree Conditions for Graphs to be λ3-optimal and Super-λ3 [ J ]. Discrete Math,2009,309:336 -345.
  • 6陈亮,高敬振.图的λ_3最优性的充分条件[J].山东师范大学学报（自然科学版）,2008,23(3):1-4. 被引量：6
  • 7BONSMA P, UEFFING N, VOLKMANN L. Edge- cuts Leaving Components of Order at Least Three [ J ]. Discrete Math,2002,256: 431 - 439.

二级参考文献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,reliability comparison and transitivity of graphs[J]. Diserete Math,2002,117:183- 193
  • 5Hellwig A, Volkmanm L. Sufficient conditions for λ'- optimality in graphs of diameter 2[J] .Discrete Math,2004,283:113 - 120
  • 6Hellwig A, Volkmanm L. Sufficient condltions for graphs to be λ' - optimal, super- edge- connected,and maximally edge- connected[J].J Graph Theory, 2005,48:228~246
  • 7Bonsma P, et al. Edge - cuts leaving componentsof order at least three[J]. Discrete Math,2002,258:431 - 439
  • 8高秀莲,高敬振.连圈图的排斥(整)和数[J].山东师范大学学报（自然科学版）,2007,22(4):15-16. 被引量：1
  • 9高敬振,张凤娟.图是λ_3-最优的最小度条件[J].山东师范大学学报（自然科学版）,2008,23(2):1-3. 被引量：4

共引文献5

同被引文献15

  • 1Provan J S,Ball M O.The complexity of counting cuts and of computing the probability that a graph is connected.SIAM J Comput,1983;12:777-788.
  • 2Wang M,Li Q.Conditional edge connectivity properties,reliability comparison and transitivity of graphs.Discrete Math,2002;258:205-214.
  • 3Esfahanian A H,Hakimi S L.On computing a conditional edge connectivity of a graph.Inf Process Letter,1988;27:195-199.
  • 4Meng J X,Ji Y H.On a kind of restricted edge connectivity of graphs.Discrete Math,2003; 260:239-248.
  • 5Ou J P.Restricted edge connectivity and network reliability.Doctoral Dissertation,Xiamen University,2003.
  • 6Wang S Y,Lin S W,Li C F.Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2.Discrete Math,2009;309(4):908-919.
  • 7Bonsmap P,Ueffing N,Volkmann L.Edge-cuts leaving components of order at least three.Discrete Math,2002;256:431-439.
  • 8BOLLOBAS B.Modern graph theory[M].New York:Springer-Verlag,1998.
  • 9ESFAHANIAN A H,HAHIMI S L On computing a conditional edge connectivity of a graph[J].Inf Process Letter,1988,27:195-199.
  • 10ESFAHANIAN A H.Generalized measures of fault tolerance with application to N-cube networks[J].IEEE Trans Comput,1989,38:1586-1591.

引证文献2

山东科学
2010年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部