Rainbow perfect domination in lattice graphs
<p>Let <span class="math">0 < <em>n</em> ∈ Z</span>. In the unit distance graph of <span class="math">Z<sup><em>n</em></sup> ⊂ R<sup><em>n</em></sup></span>, a perfect dominating set...
Main Authors: | Luis R. Fuentes, Italo J. Dejter, Carlos A. Araujo |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-04-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/265 |
Similar Items
-
Lattice-Like Total Perfect Codes
by: Araujo Carlos, et al.
Published: (2014-02-01) -
Perfect Outer-connected Domination in the Join and Corona of Graphs
by: Enrico Enriquez, et al.
Published: (2016-12-01) -
Perfect secure domination in graphs
by: S.V. Divya Rashmi, et al.
Published: (2017-07-01) -
Maximal 2-rainbow domination number of a graph
by: H. Abdollahzadeh Ahangar, et al.
Published: (2016-08-01) -
Perfect Roman domination in middle graphs
by: Kijung Kim
Published: (2021-08-01)