Existence of spanning k-ended trees in claw-free graphs
Let T be a tree.A vertex of degree one is a leaf of T.A tree having at most k leaves is called a k-ended tree.A Hamiltonian path is a spanning tree having exactly two leaves.From this point of view,some sufficient conditions for a graph to have a Hamiltonian path are modified to those for a spanning k-ended tree.A sufficient condition using dominating set is given for a connected claw-free graph who has spanning k-ended tree.
国家科技期刊平台
NSTL
万方数据
维普
