Papers
Topics
Authors
Recent
Search
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 SS of a graph GG is a perfect (resp. quasiperfect) dominating set in GG if each vertex vv of G∖SG\setminus S is adjacent to only one vertex (dv∈1,2d_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.

Citations (14)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.