CSpace
someresultsonspanningtrees
Yao Bing1; Zhang Zhongfu1; Wang Jianfang2
2010
Source Publicationactamathematicaeapplicataesinica
ISSN0168-9673
Volume000Issue:004Pages:607
AbstractSome structures of spanning trees with many or less leaves in a connected graph are determined.We show(1) a connected graph G has a spanning tree T with minimum leaves such that T contains a longest path,and(2) a connected graph G on n vertices contains a spanning tree T with the maximum leaves such that Δ(G) =Δ(T) and the number of leaves of T is not greater than n D(G)+1,where D(G) is the diameter of G.
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/43846
Collection中国科学院数学与系统科学研究院
Affiliation1.西北师范大学
2.中国科学院数学与系统科学研究院
Recommended Citation
GB/T 7714
Yao Bing,Zhang Zhongfu,Wang Jianfang. someresultsonspanningtrees[J]. actamathematicaeapplicataesinica,2010,000(004):607.
APA Yao Bing,Zhang Zhongfu,&Wang Jianfang.(2010).someresultsonspanningtrees.actamathematicaeapplicataesinica,000(004),607.
MLA Yao Bing,et al."someresultsonspanningtrees".actamathematicaeapplicataesinica 000.004(2010):607.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yao Bing]'s Articles
[Zhang Zhongfu]'s Articles
[Wang Jianfang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yao Bing]'s Articles
[Zhang Zhongfu]'s Articles
[Wang Jianfang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yao Bing]'s Articles
[Zhang Zhongfu]'s Articles
[Wang Jianfang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.