| Halin图的线性2-荫度 |
| |
| 引用本文： | 钱景.Halin图的线性2-荫度[J].山东理工大学学报,2006,20(3):3-5,8. |
| |
| 作者姓名： | 钱景 |
| |
| 作者单位： | 浙江师范大学数理学院 浙江金华321004 |
| |
| 基金项目： | 国家自然科学基金;浙江省自然科学基金 |
| |
| 摘 要： | 图G的线性2荫度la2(G)是将G分解为k个边不交的森林的最小整数k,其中每个森林的分支树的长度至多为2的路.给出了Halin图G的线性2荫度.
|
| 关 键 词： | 图论 Halin图 树 线性2荫度 |
| 文章编号： | 1672-6197（2006）03-0003-03 |
| 收稿时间： | 09 27 2005 12:00AM |
| 修稿时间： | 2005-09-27 |
The linear 2-arboricity of Halin graphs |
| |
| QIAN Jing.The linear 2-arboricity of Halin graphs[J].Journal of Shandong University of Technology:Science and Technology,2006,20(3):3-5,8. |
| |
| Authors: | QIAN Jing |
| |
| Institution: | Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China |
| |
| Abstract: | The linear 2arboricity la_2(G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests,whose component trees are paths of length at most 2.In this paper,the linear 2-arboricity of Haling graphs was derived. |
| |
| Keywords: | graph theory halin graph tree linear 2-arboricity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
