Quasiperfect domination in triangular lattices
暂无分享,去创建一个
A vertex subset $S$ of a graph $G$ is a perfect (resp. quasiperfect) dominating set in $G$ if each vertex $v$ of $G\setminus S$ is adjacent to only one vertex ($d_v\in\{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_{\nu}$, where $\nu\in\{1,2,3\}$ depends only on $S$.
[1] Italo J. Dejter,et al. Perfect domination in rectangular grid graphs , 2007, 0711.4345.
[2] Italo J. Dejter. Perfect domination in regular grid graphs , 2008, Australas. J Comb..
[3] Jan Kratochvíl,et al. On the Computational Complexity of Codes in Graphs , 1988, MFCS.
[4] Carsten Thomassen. On the Nelson Unit Distance Coloring Problem , 1999 .