引用本文
  • 潘登斌.关于二分图的线连通度的一个结论[J].广西科学院学报,2003,(1):33-34,38.    [点击复制]
  • Pan Dengbin.A Conclusion on Line-connected Degree of Bipartite Graph[J].Journal of Guangxi Academy of Sciences,2003,(1):33-34,38.   [点击复制]
【打印本页】 【在线阅读全文】【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 295次   下载 291 本文二维码信息
码上扫一扫!
关于二分图的线连通度的一个结论
潘登斌
0
(广西职业技术学院, 南宁 530226)
摘要:
在Chartrand.G和Lesniak关于图的线连通性定理的基础上,讨论二分图的线连通度问题,得到结论:若G=(X,Y;E)是二分图,对任意一对不相邻的点u、v,d(u)+d(v)>[p/2],则λ(G)=δ(G).
关键词:  二分图  线连通度  不相邻
DOI:
投稿时间:2002-04-28
基金项目:
A Conclusion on Line-connected Degree of Bipartite Graph
Pan Dengbin
(Guangxi Vocational College, Nanning, 530226)
Abstract:
Based on the studies of Chartrand G and Lesniak on line connected theory of graph,the line-connected degree of bipartite graph is discussed.A conclusion is obtained as follows:for any pairs of discontinuous points (u,v), if G=(X,Y;E) is a bipartite graph, d(u)+d(v)>[p/2], then λ(G)=δ(G).
Key words:  bipartite graph  line-connected degree  discontinuous

用微信扫一扫

用微信扫一扫