Rainbow perfect domination in lattice graphs
From MaRDI portal
Publication:5009971
DOI10.5614/ejgta.2018.6.1.7zbMath1467.05187OpenAlexW2797120489MaRDI QIDQ5009971
Luis R. Fuentes, Carlos A. G. jun. Araújo, Italo Jose Dejter
Publication date: 23 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2018.6.1.7
Lattice packing and covering (number-theoretic aspects) (11H31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Related Items (3)
Signless normalized Laplacian for hypergraphs ⋮ On the k-rainbow domination in graphs with bounded tree-width ⋮ Perfect domination ratios of Archimedean lattices
Cites Work
- Hardness and algorithms for rainbow connection
- Fast decoding of quasi-perfect Lee distance codes
- Constructing covering codes with given automorphisms
- Rainbow connections of graphs: a survey
- A generalization of Lee codes
- Lattice-like total perfect codes
- Perfect codes in graphs
- Perfect codes in Cartesian products of 2-paths and infinite paths
- Tilings by $(0.5,n)$-Crosses and Perfect Codes
- Rainbow trees in graphs and generalized connectivity
- Rainbow connection in graphs
- Perfect domination in rectangular grid graphs
- Dominating sets in n‐cubes
- There is but one PDS in $\mathbb{Z}^{3}$ inducing just square components
- A Taxonomy of Perfect Domination
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- Product Constructions for Perfect Lee Codes
- Perfect domination in regular grid graphs
- Encyclopedia of Distances
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Rainbow perfect domination in lattice graphs
