-dominating -ended trees of -connected graphs
Let , and be integers, and let be an -connected graph. If there exists a subgraph of such that the distance between and is at most for any , then we say that -dominates . A subset of is said to be -stable if the distance between each pair of distinct vertices in is at least . In this paper, we prove...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.04.004 |
| Summary: | Let , and be integers, and let be an -connected graph. If there exists a subgraph of such that the distance between and is at most for any , then we say that -dominates . A subset of is said to be -stable if the distance between each pair of distinct vertices in is at least . In this paper, we prove that if does not have a -stable set of order at least , then has an -dominating tree which has at most leaves. |
|---|---|
| ISSN: | 0972-8600 |