The following pages link to (Q3413877):
Displaying 13 items.
- Total perfect codes in Cayley graphs (Q329192) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- Efficient sets in graphs (Q686251) (← links)
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- An algorithm for prescribed multiple domination in arbitrary graphs (Q1608446) (← links)
- Perfect codes in power graphs of finite groups (Q1687066) (← links)
- Existence of efficient total dominating sets of circulant graphs of degree 4 (Q2286605) (← links)
- On efficient dominating sets in simplicial graphs (Q2906264) (← links)
- (Q5104007) (← links)
- Perfect codes in proper reduced power graphs of finite groups (Q5131756) (← links)
- Perfect codes and universal adjacency spectra of commuting graphs of finite groups (Q5882598) (← links)
- On subgroup regular sets in Cayley sum graphs (Q6553168) (← links)
- Subgroup total perfect codes in Cayley sum graphs (Q6591963) (← links)