摘要
本文证明了：若Ｇ是Ｈａｌｉｎ图，则Ｇ的线性荫度为［△（Ｇ）／２］，点荫度和线性点荫度为２，路分解数等于它的奇数度顶点的一半。
In the paper, we prove that if G is a Halin graph, then the linear arboricity of Gis 「△(G)/2,the vertex arboricity and the vertex linear arboricity of G is 2, the path decomposition number of G is half of the number of vertices of odd degree.
出处
《山东矿业学院学报》
CAS
1998年第1期9296-9296,共1页
Journal of Shandong University of Science and Technology(Natural Science)
关键词
HALIN图
线性荫度
点荫度
线性点荫度
路分解数
Halin graph
linear arboricity
vertex arboricity
vertex linear arboricity
path decomposition number.
