Name
Abstract | ||
|---|---|---|
Let k≥2, l≥1 and m≥0 be integers, and let G be an l-connected graph. If there exists a subgraph X of G such that the distance between v and X is at most m for any v∈V(G), then we say that X
m-dominates G. A subset S of V(G) is said to be 2(m+1)-stable if the distance between each pair of distinct vertices in S is at least 2(m+1). In this paper, we prove that if G does not have a 2(m+1)-stable set of order at least k+l, then G has an m-dominating tree which has at most k leaves. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.akcej.2017.04.004 | AKCE International Journal of Graphs and Combinatorics |
Keywords | DocType | Volume |
Vertex dominating,
m-dominating,
k-ended tree | Journal | 14 |
Issue | ISSN | Citations |
3 | 0972-8600 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masao Tsugaki | 1 | 32 | 13.71 |
| Guiying Yan | 2 | 196 | 22.92 |