Dominating sets in n‐cubes

DOI10.1002/jgt.3190180506zbMath0806.05061OpenAlexW2068510635MaRDI QIDQ4304253

Paul M. Weichsel

Publication date: 14 February 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180506

zbMATH Keywords

\(n\)-cubeperfect dominating set

Mathematics Subject Classification ID

Steiner systems in finite geometry (51E10) Triple systems (05B07) Graph theory (05C99) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (18)

Complexity issues of perfect secure domination in graphs ⋮ Almost injective colorings ⋮ Weighted efficient domination problem on some perfect graphs ⋮ Efficient domination through eigenvalues ⋮ Structure of squares and efficient domination in graph classes ⋮ The weighted perfect domination problem and its variants ⋮ Modelling and solving the perfect edge domination problem ⋮ Extended formulations for perfect domination problems and their algorithmic implications ⋮ Perfect domination and small cycles ⋮ A generalization of Lee codes ⋮ Lattice-like total perfect codes ⋮ (Total) domination in prisms ⋮ Independent perfect domination sets in Cayley graphs ⋮ Connectivity and edge-bipancyclicity of Hamming shell ⋮ Perfect domination sets in Cayley graphs ⋮ Rainbow perfect domination in lattice graphs ⋮ Outer complete fair domination in graphs ⋮ Equitable fair domination in graphs

Cites Work

• On the Addressing Problem for Loop Switching

This page was built for publication: Dominating sets in n‐cubes