Spanning Trees with Few Leaves in Almost Claw-Free Graphs

作     者：Xiaodong CHEN Mingchu LI Meijin XU 

作者机构：College of Science Liaoning University of Technology School of Softsware Dalian University of Technology 

出 版 物：《Journal of Mathematical Research with Applications》 (数学研究及应用(英文版))

年 卷 期：2016年第36卷第4期

页      面：450-456页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China,Tian Yuan Special Foundation(Grant No.11426125) by Educational Commission of Liaoning Province(Grant No.L2014239) 

主　　题：spanning 3-ended tree almost claw-free graph insertible vertex non-insertible vertex 

摘      要：A spanning tree with no more than 3 leaves is called a spanning 3-ended *** this paper, we prove that if G is a k-connected（k ≥ 2） almost claw-free graph of order n and σ;（G） ≥ n + k + 2, then G contains a spanning 3-ended tree, where σk（G） =min{∑;deg（v） : S is an independent set of G with |S| = k}.