Total perfect codes in grid graphs
From MaRDI portal
Recommendations
Cited in
(17)- Completely regular codes in the infinite hexagonal grid
- Total perfect codes, OO-irredundant and total subdivision in graphs
- Efficient closed domination in digraph products
- A generalization of Lee codes
- Lattice-like total perfect codes
- \([1,2]\)-sets in graphs
- Odd neighborhood transversals on grid graphs
- Total perfect codes in tensor products of graphs.
- Total perfect codes in Cayley graphs
- Perfect domination in rectangular grid graphs
- Rainbow perfect domination in lattice graphs
- A Taxonomy of Perfect Domination
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- 1,2-efficiency in grid graphs
- Efficient total domination and related invariants in torus graphs
- New characterization of efficient closed and open dominated graphs
- On maximizing private neighbors in graphs
This page was built for publication: Total perfect codes in grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480690)
