Trees with the connected domination number
Utilitas Mathematica · 10.05.2026 · 127 · 209-215
DOI: 10.61091/um127-14 ↗Kurz gefasst
Fachartikel in der Zeitschrift Utilitas Mathematica, online erschienen am 10.05.2026. Verfasst von Min-Jen Jou und 1 weiteren Autor:innen.
Abstract (Originalsprache)
In a graph, the distance between two vertices is the length of a shortest path connecting them. The distance-2 domination number \(\gamma_2(G)\) of a graph \(G\) is the minimum size of a vertex subset such that every vertex outside it is within distance two of some subset vertex. In a connected graph, a connected dominating set is a subset \(S\) whose induced subgraph is connected and in which every vertex not in \(S\) is adjacent to some vertex in \(S\); the connected domination number \(\gamma_c(G)\) is the size of a smallest such set. For \(k\ge 1\), let 𝒯k be the set of trees \(T\) satisfying \(\gamma_c(T)=2\gamma_2(T)=2k\). The collection 𝒯1 is the set of all double stars. In this paper, we provide a constructive characterization of 𝒯k for all \(k\ge 2\).
Zitieren
APA
Jou, M., & Lin, J. (2026). Trees with the connected domination number. Utilitas Mathematica, 127, 209-215. https://doi.org/10.61091/um127-14
Vancouver
Jou M, Lin J. Trees with the connected domination number. Utilitas Mathematica. 2026;127:209-215. doi:10.61091/um127-14
BibTeX
@article{Jou2026,
author = {Jou, Min-Jen and Lin, Jenq-Jong},
title = {Trees with the connected domination number},
journal = {Utilitas Mathematica},
year = {2026},
volume = {127},
pages = {209--215},
doi = {10.61091/um127-14}
}
EUVIMED