English

Quasiperfect domination in triangular lattices

Combinatorics 2009-04-03 v1 Information Theory math.IT

Abstract

A vertex subset SS of a graph GG is a perfect (resp. quasiperfect) dominating set in GG if each vertex vv of GSG\setminus S is adjacent to only one vertex (dv{1,2}d_v\in\{1,2\} vertices) of SS. Perfect and quasiperfect dominating sets in the regular tessellation graph of Schl\"afli symbol {3,6}\{3,6\} and in its toroidal quotients are investigated, yielding the classification of their perfect dominating sets and most of their quasiperfect dominating sets SS with induced components of the form KνK_{\nu}, where ν{1,2,3}\nu\in\{1,2,3\} depends only on SS.

Keywords

Cite

@article{arxiv.0903.3685,
  title  = {Quasiperfect domination in triangular lattices},
  author = {Italo J. Dejter},
  journal= {arXiv preprint arXiv:0903.3685},
  year   = {2009}
}

Comments

20 pages, 9 figures, 5 arrays

R2 v1 2026-06-21T12:43:01.118Z