Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2018 | ARS COMBINATORIA | Spanning 3-ended tree,Quasi-claw-free graph,Insertible vertex |
Field | DocType | Volume |
Graph,Discrete mathematics,Claw,Combinatorics,Mathematics | Journal | 138 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaodong Chen | 1 | 3 | 1.83 |
| Mingchu Li | 2 | 469 | 78.10 |
| Fuliang Lu | 3 | 0 | 1.01 |