KMS Of Academy of mathematics and systems sciences, CAS
| someresultsonspanningtrees | |
| Yao Bing1; Zhang Zhongfu1; Wang Jianfang2 | |
| 2010 | |
| 发表期刊 | actamathematicaeapplicataesinica
 |
| ISSN | 0168-9673 |
| 卷号 | 000期号:004页码:607 |
| 摘要 | 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 Δ（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. |
| 语种 | 英语 |
| 文献类型 | 期刊论文 |
| 条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/43846 |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 1.西北师范大学 2.中国科学院数学与系统科学研究院 |
| 推荐引用方式 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. |
| 条目包含的文件 | 条目无相关文件。 | |||||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论