Quasiperfect domination in triangular lattices
From MaRDI portal
Publication:5324110
DOI10.7151/dmgt.1439zbMath1189.05125arXiv0903.3685OpenAlexW2964156607MaRDI QIDQ5324110
Publication date: 3 August 2009
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.3685
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Total \([1,2\)-domination in graphs], \((1, j)\)-set problem in graphs, \([1,2\)-domination in graphs], When an optimal dominating set with given constraints exists, On the \([1,2\)-domination number of generalized Petersen graphs], \([1,2\)-sets in graphs], \([1,k\)-domination number of lexicographic products of graphs], Unnamed Item, Perfect domination ratios of Archimedean lattices, On perfect and quasiperfect dominations in graphs