Quasiperfect domination in triangular lattices
classification
🧮 math.CO
cs.ITmath.IT
keywords
dominatingquasiperfectperfectsetsvertexgraphonlyadjacent
read the original abstract
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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.