期刊文献+

图是λ_5-最优的充分条件

Sufficient Conditions for Graphs to be λ_5-Optimal
下载PDF
导出
摘要 文章给出了图是λ5-最优的邻域交条件.设G是一个λ5-连通图,定义ξ5(G)=min{|[X,]|:X∈V(G),|X|=5,G[X]连通},若λ5(G)=ξ3(G),则称G是λ5-最优的.若对G中任意一对不相邻的顶点u和v,都有|N(u)∩N(v)|≥5且G满足ξ3(G)≤V(G)/2+10,|V(G)|≥31,则G是λ5-最优的. A neighborhood condition for graphs to be λ5-optimal has been given.Let G be a λ5-connected graph and define ξ5(G)=min{|[X,]|:X∈V(G),|X|=5,G[X] is connected}.The graph G is called a λ5-optimal graph if λ5(G)=ξ3(G).If |N(u)∩N(v)|≥5 for any pair of nonadjacent vertices u,v∈G and ξ5(G)≤ V(G)/2+10,|V(G)|≥31),then G is λ5-optimal.
出处 《太原师范学院学报(自然科学版)》 2011年第2期22-24,共3页 Journal of Taiyuan Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(61070229)
关键词 5-限制边连通度 λ5-最优 邻域 λ5-连通图 5-restricted edge connectivity λ5-optimality neighborhood λ5-connectedgraphs
  • 引文网络
  • 相关文献

参考文献2

  • 1Wang Shiying, Lin Shangwei, Li Chunfang. Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2[J]. Discrete Mathematics,2009,304(4) :908-919.
  • 2王世英,林上为.网络边连通性的最优化[M].北京:科学出版社,2009.

共引文献5

;
使用帮助 返回顶部