Some Results on Spanning Trees

作     者：Bing Yao Zhong-fu Zhang Jian-fang Wang 

作者机构：College of Mathematics and Information ScienceNorthwest Normal UniversityLanzhou 730070China Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China 

出 版 物：《Acta Mathematicae Applicatae Sinica》 (应用数学学报（英文版）)

年 卷 期：2010年第26卷第4期

页      面：607-616页

核心收录：

学科分类：07[理学] 08[工学] 070104[理学-应用数学] 0701[理学-数学] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Supported by the National Natural Science Foundation of China (No.10771091) Project of Knowledge and Science Innovation Program of Northwest Normal University (Grant No.NWNU-KJCXGC-3-47) 

主　　题：Spanning tree leaves diameter Steiner tree independent number 

摘      要：Some structures of spanning trees with many or less leaves in a connected graph are *** 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.