摘要
讨论了满足σ２（Ｇ）≥ｎ－２的连通图的链覆盖问题．证明了当连通图Ｇ满足σ２（Ｇ）≥ｎ－２时，对任意的奇数ｋ（１≤ｋ≤ｎ－１），存在阶为ｋ和（ｎ－ｋ）的两条链覆盖Ｇ，特别当图Ｇ的阶数为奇数时存在Ｈａｍｉｌｔｏｎ链，并在此条件下得出链覆盖数为π（Ｇ）＝２时的极限图类．
he path covering problem satisfying
2(G)n-2 in connected graph is discussed.For all odd k (1kn-1),if G satisfied 2(G)n-2,there are two
paths of orders k and (n-k) coverd G. Particular, while the order of a graph G is odd,it will consist a
hamilton path. Under this condition, a kind of extreme graphs while covering nember is (G)=2 is
gived.
出处
《郑州轻工业学院学报》
1999年第2期71-74,共4页
Journal of Zhengzhou Institute of Light Industry（Natural Science）
关键词
覆盖
次数
哈密顿路
哈密顿图
图论
overing
degree
hamilton path
hamiltonian cycles
