|
个人信息Personal Information
教授
博士生导师
硕士生导师
主要任职：Director of Academic Committee at Kaifa District
其他任职：开发区校区学术分委员会主任（Director of Academic Committee at Kaifa Campus）
性别：男
毕业院校：多伦多大学
学位：博士
所在单位：软件学院、国际信息与软件学院
学科：软件工程. 运筹学与控制论
办公地点：开发区（Kaifa District Campus）
联系方式：mingchul@dlut.edu.cn
电子邮箱：mingchul@dlut.edu.cn
Spanning 3-ended trees in quasi-claw-free graphs
点击次数：
论文类型：期刊论文
发表时间：2018-04-01
发表刊物：ARS COMBINATORIA
收录刊物：SCIE
卷号：138
页面范围：161-170
ISSN号：0381-7032
关键字：Spanning 3-ended tree; Quasi-claw-free graph; Insertible vertex
摘要：Let sigma(k)(G) denote the minimum degree sum of k independent vertices of a graph G. A spanning tree with at most m leaves is called a spanning m-ended tree. A graph is quasi-claw-free if for any two vertices x, y with d(x, y) = 2, there exists a vertex u such that u is an element of N (x) boolean AND N (y), N (u) subset of N [x] boolean OR N[y]. In this paper, we prove that for any k-connected quasi-claw-free graph G with order n, if sigma(k+3)(G) >= n - k, then G contains a spanning 3-ended tree.