Dominating sets in n‐cubes
From MaRDI portal
Publication:4304253
Recommendations
Cites work
Cited in
(30)- Weighted efficient domination problem on some perfect graphs
- \((d,m)\)-dominating numbers of hypercube
- Almost injective colorings
- The weighted perfect domination problem and its variants
- Connectivity and edge-bipancyclicity of Hamming shell
- Modelling and solving the perfect edge domination problem
- A generalization of Lee codes
- Lattice-like total perfect codes
- Independent perfect domination sets in Cayley graphs
- Efficient domination through eigenvalues
- Structure of squares and efficient domination in graph classes
- scientific article; zbMATH DE number 5072535 (Why is no real title available?)
- scientific article; zbMATH DE number 90561 (Why is no real title available?)
- scientific article; zbMATH DE number 617558 (Why is no real title available?)
- scientific article; zbMATH DE number 637526 (Why is no real title available?)
- There is but one PDS in \(\mathbb{Z}^3\) inducing just square components
- scientific article; zbMATH DE number 871180 (Why is no real title available?)
- Rainbow perfect domination in lattice graphs
- Equitable fair domination in graphs
- Complexity issues of perfect secure domination in graphs
- (Total) domination in prisms
- Perfect domination and small cycles
- Outer complete fair domination in graphs
- Extended formulations for perfect domination problems and their algorithmic implications
- Reception capacity: definitions, game theory and hardness
- Autonomous domination
- Perfect truncated-metric codes in lattice graphs and superlattice graphs
- Locating fair domination in graphs
- Title not available (Why is no real title available?)
- Perfect domination sets in Cayley graphs
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)
