-dominating -ended trees of -connected graphs

-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...

Full description

Bibliographic Details
Main Authors: Masao Tsugaki, Guiying Yan
Format: Article
Language:English
Published: Taylor & Francis Group 2017-12-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
vertex dominating
-dominating
-ended tree
Online Access:http://dx.doi.org/10.1016/j.akcej.2017.04.004
id doaj-bc92e68749e942caaf27d67872130a18
record_format Article
spelling doaj-bc92e68749e942caaf27d67872130a182020-11-25T03:29:42ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002017-12-0114327728610.1016/j.akcej.2017.04.00412092635-dominating -ended trees of -connected graphsMasao Tsugaki0Guiying Yan1Tokyo University of Science, KagurazakaInstitute of mathematical and system sciences, Chinese Academy of ScienceLet , 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.http://dx.doi.org/10.1016/j.akcej.2017.04.004vertex dominating -dominating -ended tree
collection DOAJ
language English
format Article
sources DOAJ
author Masao Tsugaki
Guiying Yan
spellingShingle Masao Tsugaki
Guiying Yan
-dominating -ended trees of -connected graphs
AKCE International Journal of Graphs and Combinatorics
vertex dominating
-dominating
-ended tree
author_facet Masao Tsugaki
Guiying Yan
author_sort Masao Tsugaki
title -dominating -ended trees of -connected graphs
title_short -dominating -ended trees of -connected graphs
title_full -dominating -ended trees of -connected graphs
title_fullStr -dominating -ended trees of -connected graphs
title_full_unstemmed -dominating -ended trees of -connected graphs
title_sort -dominating -ended trees of -connected graphs
publisher Taylor & Francis Group
series AKCE International Journal of Graphs and Combinatorics
issn 0972-8600
publishDate 2017-12-01
description 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.
topic vertex dominating
-dominating
-ended tree
url http://dx.doi.org/10.1016/j.akcej.2017.04.004
work_keys_str_mv AT masaotsugaki dominatingendedtreesofconnectedgraphs
AT guiyingyan dominatingendedtreesofconnectedgraphs
_version_ 1724577558427598848

Similar Items