Quasiperfect domination in triangular lattices
Abstract
A vertex subset S of a graph G is a perfect (resp. quasiperfect) dominating set in G if each vertex v of G S is adjacent to only one vertex (dv∈\1,2\ vertices) of S. Perfect and quasiperfect dominating sets in the regular tessellation graph of Schl\"afli symbol \3,6\ and in its toroidal quotients are investigated, yielding the classification of their perfect dominating sets and most of their quasiperfect dominating sets S with induced components of the form K, where ∈\1,2,3\ depends only on S.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.