Some Results on Spanning Trees
Yao, Bing1; Zhang, Zhong-fu1; Wang, Jian-fang2
刊名ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES
2010
卷号26期号:4页码:607-616
关键词Spanning tree leaves diameter Steiner tree independent number
ISSN号0168-9673
DOI10.1007/s10255-010-0011-4
英文摘要Some 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 Delta(G) = Delta(T) and the number of leaves of T is not greater than n - D(G) + 1, where D(G) is the diameter of G.
资助项目National Natural Science Foundation of China[10771091] ; Northwest Normal University[NWNU-KJCXGC-3-47]
WOS研究方向Mathematics
语种英语
出版者SPRINGER HEIDELBERG
WOS记录号WOS:000282285600008
内容类型期刊论文
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/9554]  
专题中国科学院数学与系统科学研究院
通讯作者Yao, Bing
作者单位1.NW Normal Univ, Coll Math & Informat Sci, Lanzhou 730070, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Yao, Bing,Zhang, Zhong-fu,Wang, Jian-fang. Some Results on Spanning Trees[J]. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,2010,26(4):607-616.
APA Yao, Bing,Zhang, Zhong-fu,&Wang, Jian-fang.(2010).Some Results on Spanning Trees.ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,26(4),607-616.
MLA Yao, Bing,et al."Some Results on Spanning Trees".ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES 26.4(2010):607-616.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace