English

Dominating Plane Triangulations

Combinatorics 2014-08-21 v1

Abstract

In 1996, Tarjan and Matheson proved that if GG is a plane triangulated disc with nn vertices, γ(G)n/3\gamma (G)\le n/3, where γ(G)\gamma (G) denotes the domination number of GG. Furthermore, they conjectured that the constant 1/31/3 could be improved to 1/41/4 for sufficiently large nn. Their conjecture remains unsettled. In the present paper, it is proved that if GG is a hamiltonian plane triangulation with V(G)=n|V(G)|=n vertices and minimum degree at least 4, then γ(G)max{2n/7,5n/16}\gamma (G)\le\max\{\lceil 2n/7\rceil, \lfloor 5n/16\rfloor\}. It follows immediately that if GG is a 4-connected plane triangulation with nn vertices, then γ(G)max{2n/7,5n/16}\gamma (G)\le\max\{\lceil 2n/7\rceil, \lfloor 5n/16\rfloor\} . It then follows that if n26n\ge 26, then γ(G)5n/16\gamma (G)\le \lfloor 5n/16\rfloor.

Keywords

Cite

@article{arxiv.1408.4530,
  title  = {Dominating Plane Triangulations},
  author = {Michael D. Plummer and Dong Ye and Xiaoya Zha},
  journal= {arXiv preprint arXiv:1408.4530},
  year   = {2014}
}

Comments

13 pages, 14 figures

R2 v1 2026-06-22T05:34:15.009Z