Perfect domination in regular grid graphs
From MaRDI portal
Publication:5503347
zbMath1153.05042arXiv0711.4343MaRDI QIDQ5503347
Publication date: 15 January 2009
Full work available at URL: https://arxiv.org/abs/0711.4343
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (21)
On the efficiency index of a graph ⋮ Unnamed Item ⋮ Total perfect codes in Cayley graphs ⋮ On the perfect differential of a graph ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ GROUP PERFECT CODE IN COMMUTING ORDER PRODUCT PRIME GRAPH ⋮ Efficient closed domination in digraph products ⋮ A note on the fair domination number in outerplanar graphs ⋮ A generalization of Lee codes ⋮ Fair domination in graphs ⋮ Efficient domination in cubic vertex-transitive graphs ⋮ Fair domination number in cactus graphs ⋮ \([1,2\)-sets in graphs] ⋮ Fair total domination number in cactus graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Unnamed Item ⋮ Domination in Cayley graphs: a survey ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs ⋮ Perfect domination ratios of Archimedean lattices ⋮ Structure and substructure connectivity of circulant graphs and hypercubes ⋮ Rainbow perfect domination in lattice graphs
This page was built for publication: Perfect domination in regular grid graphs
