Hits:

Indexed by:期刊论文

Date of Publication:2017-01-01

Journal:ARS COMBINATORIA

Included Journals:SCIE、Scopus

Volume:131

Page Number:161-168

ISSN No.:0381-7032

Key Words:spanning 3-ended tree; claw-free graph; non-insertible vertex

Abstract:Let sigma(k)(G) denote the minimum degree sum of k independent vertices of a graph G. A spanning tree with at most 3 leaves is called a spanning 3-ended tree. In this paper, we prove that for any k-connected claw-free graph G with vertical bar G vertical bar = n, if sigma(k)+3(G) >= n - k, then G contains a spanning 3 -ended tree.