Rainbow perfect domination in lattice graphs

DOI10.5614/EJGTA.2018.6.1.7MaRDI QIDQ5009971zbMATH OpenOpenAlexWikidataFDO

Authors Luis R. Fuentes, Carlos A. G. jun. Araújo, Italo J. Dejter

Publication date 23 August 2021

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2018.6.1.7

zbMATH Keywords

latticeperfect dominating setrainbow spheretiling

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Lattice packing and covering (number-theoretic aspects) (11H31) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Combinatorial codes (94B25)

Recommendations

• Rainbow domination and related problems on some classes of perfect graphs
• Rainbow domination in graphs
• Rainbow domination in graphs
• On rainbow domination numbers of graphs
• Rainbow dominator coloring in graphs
• Rainbow edge domination numbers in graphs
• Global rainbow domination in graphs
• On \(k\)-rainbow domination in regular graphs
• Independent rainbow domination of graphs
• Rainbow domination numbers on graphs with given radius

Cites work

• A generalization of Lee codes
• A Taxonomy of Perfect Domination
• Constructing covering codes with given automorphisms
• Dominating sets in n‐cubes
• Encyclopedia of distances
• Hardness and algorithms for rainbow connection
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 91051 (Why is no real title available?)
• scientific article; zbMATH DE number 617558 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1156671 (Why is no real title available?)
• scientific article; zbMATH DE number 1943109 (Why is no real title available?)
• scientific article; zbMATH DE number 818205 (Why is no real title available?)
• scientific article; zbMATH DE number 871180 (Why is no real title available?)
• scientific article; zbMATH DE number 975419 (Why is no real title available?)
• scientific article; zbMATH DE number 2230323 (Why is no real title available?)
• Lattice-like total perfect codes
• Perfect codes in Cartesian products of 2-paths and infinite paths
• Perfect codes in graphs
• Perfect domination in rectangular grid graphs
• Perfect domination in regular grid graphs
• Product Constructions for Perfect Lee Codes
• Rainbow connection in graphs
• Rainbow trees in graphs and generalized connectivity
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• There is but one PDS in \(\mathbb{Z}^3\) inducing just square components
• Tilings by (0.5,n)-crosses and perfect codes
• Total perfect codes in grid graphs

Cited in

(5)

• Perfect domination ratios of Archimedean lattices
• There is but one PDS in \(\mathbb{Z}^3\) inducing just square components
• Signless normalized Laplacian for hypergraphs
• On the \(k\)-rainbow domination in graphs with bounded tree-width
• Perfect truncated-metric codes in lattice graphs and superlattice graphs

This page was built for publication: Rainbow perfect domination in lattice graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009971)