The following pages link to Dominating sets in <i>n</i>‐cubes (Q4304253):
Displaying 22 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- (Total) domination in prisms (Q510330) (← links)
- Perfect domination sets in Cayley graphs (Q741744) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- \((d,m)\)-dominating numbers of hypercube (Q1607520) (← links)
- Almost injective colorings (Q1630939) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- Connectivity and edge-bipancyclicity of Hamming shell (Q2008085) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- A generalization of Lee codes (Q2436575) (← links)
- Lattice-like total perfect codes (Q2442269) (← links)
- Independent perfect domination sets in Cayley graphs (Q2746203) (← links)
- (Q3408843) (← links)
- (Q4018733) (← links)
- Rainbow perfect domination in lattice graphs (Q5009971) (← links)
- Equitable fair domination in graphs (Q5025163) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
- Outer complete fair domination in graphs (Q5866027) (← links)
- Extended formulations for perfect domination problems and their algorithmic implications (Q6113358) (← links)
- Reception capacity: definitions, game theory and hardness (Q6536157) (← links)