Dominating sets in n‐cubes
From MaRDI portal
Publication:4304253
DOI10.1002/JGT.3190180506zbMATH Open0806.05061OpenAlexW2068510635MaRDI QIDQ4304253FDOQ4304253
Authors: 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
Recommendations
Graph theory (05C99) Steiner systems in finite geometry (51E10) Theory of error-correcting codes and error-detecting codes (94B99) Triple systems (05B07)
Cites Work
Cited In (23)
- Independent perfect domination sets in Cayley graphs
- Complexity issues of perfect secure domination in graphs
- \((d,m)\)-dominating numbers of hypercube
- Title not available (Why is that?)
- Perfect domination and small cycles
- A generalization of Lee codes
- Connectivity and edge-bipancyclicity of Hamming shell
- Outer complete fair domination in graphs
- Extended formulations for perfect domination problems and their algorithmic implications
- Efficient domination through eigenvalues
- Rainbow perfect domination in lattice graphs
- Structure of squares and efficient domination in graph classes
- Equitable fair domination in graphs
- Modelling and solving the perfect edge domination problem
- Weighted efficient domination problem on some perfect graphs
- Almost injective colorings
- The weighted perfect domination problem and its variants
- (Total) domination in prisms
- Reception capacity: definitions, game theory and hardness
- Perfect domination sets in Cayley graphs
- Title not available (Why is that?)
- There is but one PDS in \(\mathbb{Z}^3\) inducing just square components
- Lattice-like total perfect codes
This page was built for publication: Dominating sets in n‐cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4304253)
