2000 character limit reached
Quasiperfect domination in triangular lattices
Published 21 Mar 2009 in math.CO, cs.IT, and math.IT | (0903.3685v1)
Abstract: A vertex subset of a graph is a perfect (resp. quasiperfect) dominating set in if each vertex of is adjacent to only one vertex ( vertices) of . Perfect and quasiperfect dominating sets in the regular tessellation graph of Schl\"afli symbol and in its toroidal quotients are investigated, yielding the classification of their perfect dominating sets and most of their quasiperfect dominating sets with induced components of the form , where depends only on .
Paper Prompts
Sign up for free to create and run prompts on this paper.