苏健基.临界n-棱-连通图的最小度[J].数学研究及应用,1986,6(1):169~172
临界n-棱-连通图的最小度
The Winimum Degree of a Critically n-Line-Connected Graph
投稿时间:1982-05-03  
DOI:10.3770/j.issn:1000-341X.1986.01.044
中文关键词:  
英文关键词:
基金项目:
作者单位
苏健基 广西师范大学 
摘要点击次数: 1438
全文下载次数: 658
中文摘要:
      
英文摘要:
      A graph G is said to be Critically n-line-connected if it is n-line-connected. but for each x∈G, λ (G - x )≤n- 1 .The following result is proved; Every critically n-line-connected graph contains at least two vertices of degree n, and then this lower bound is best possible as n≥ 3 .
查看全文  查看/发表评论  下载PDF阅读器