Triangulations Admit Dominating Sets of Size 2n/7.
ABG Christiansen, E Rotenberg, D Rutschmann - Proceedings of the 2024 …, 2024 - SIAM
We show that every planar triangulation on n> 10 vertices has a dominating set of size 2
n/7= n/3.5. This approaches the n/4 bound conjectured by Matheson and Tarjan [12], and …
n/7= n/3.5. This approaches the n/4 bound conjectured by Matheson and Tarjan [12], and …
[HTML][HTML] The domination number of plane triangulations
S Špacapan - Journal of Combinatorial Theory, Series B, 2020 - Elsevier
We introduce a class of plane graphs called weak near-triangulations, and prove that this
class is closed under certain graph operations. Then we use the properties of weak near …
class is closed under certain graph operations. Then we use the properties of weak near …
A note on the domination number of triangulations
M Furuya, N Matsumoto - Journal of Graph Theory, 2015 - Wiley Online Library
A Note on the Domination Number of Triangulations - Furuya - 2015 - Journal of Graph Theory
- Wiley Online Library Skip to Article Content Skip to Article Information Access ByACCP …
- Wiley Online Library Skip to Article Content Skip to Article Information Access ByACCP …
[PDF][PDF] A note on domination and independence-domination numbers of graphs.
M Milanic - Ars Math. Contemp., 2013 - scholar.archive.org
Vizing's conjecture is true for graphs G satisfying γi (G)= γ (G), where γ (G) is the domination
number of a graph G and γi (G) is the independence-domination number of G, that is, the …
number of a graph G and γi (G) is the independence-domination number of G, that is, the …
Stack Domination Density
T Brauch, P Horn, A Jobson, DJ Wildstrom - Graphs and Combinatorics, 2013 - Springer
There are infinite sequences of graphs G n where| G n|= n such that the minimal dominating
sets for G i× H fall into predictable patterns, in light of which γ (G n× H) may be nearly linear …
sets for G i× H fall into predictable patterns, in light of which γ (G n× H) may be nearly linear …