Quasiperfect domination in triangular lattices

Simple item page
dc.creatorDejter, Italo J.
dc.date2009-03-21
dc.date.accessioned2026-07-07T12:59:28Z
dc.date.available2026-07-07T12:59:28Z
dc.descriptionA 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äfli 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 $ν\in\{1,2,3\}$ depends only on $S$.
dc.description20 pages, 9 figures, 5 arrays
dc.identifierhttps://arxiv.org/abs/0903.3685
dc.identifierhttp://arxiv.org/abs/0903.3685
dc.identifierDiscussiones Mathematicae Graph Theory 29(2009) 179-198
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225584
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.subject05C69, 68R10
dc.titleQuasiperfect domination in triangular lattices
dc.typetext

Files

Collections

arXiv