Efficient dominating sets in circulant graphs
From MaRDI portal
(Redirected from Publication:526230)
Recommendations
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient dominating sets in circulant graphs
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient 2-domination number in circulant graphs
- Classification of efficient dominating sets of circulant graphs of degree 5
Cites work
- Efficient dominating sets in Cayley graphs.
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient domination in circulant graphs
- Efficient domination in circulant graphs with two chord lengths
- Efficient domination in cubic vertex-transitive graphs
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- Independent perfect domination sets in Cayley graphs
- Perfect codes in circulant graphs
- Perfect codes in graphs
- Perfect codes over graphs
- Subgroups as efficient dominating sets in Cayley graphs
- The bondage numbers and efficient dominations of vertex-transitive graphs
- Worst-case efficient dominating sets in digraphs
Cited in
(43)- Efficient dominating sets in Cayley graphs.
- Cyclotomic graphs and perfect codes
- Constructing dominating sets in circulant graphs
- Efficient domination in circulant graphs
- Independent perfect domination sets in semi-Cayley graphs
- Perfect codes in Cayley sum graphs
- Efficient domination in Cayley graphs of generalized dihedral groups
- Classification of efficient dominating sets of circulant graphs of degree 5
- On subgroup perfect codes in Cayley graphs
- Existence of efficient total dominating sets of circulant graphs of degree 4
- Characterization of subgroup perfect codes in Cayley graphs
- Nonexistence of efficient dominating sets in the Cayley graphs generated by transposition trees of diameter 3
- Independent perfect dominating sets in semi-Cayley graphs
- Perfect codes in vertex-transitive graphs
- Efficient dominating sets and perfect dominating sets of circulant graphs and unicyclic graphs
- Subgroups as efficient dominating sets in Cayley graphs
- Efficient dominating sets in circulant graphs with domination number prime
- scientific article; zbMATH DE number 637297 (Why is no real title available?)
- Efficient open domination in Cayley graphs
- Perfect codes in Cayley graphs
- Efficient dominating sets in circulant graphs
- The fullerene graphs with a perfect star packing
- Subgroup Perfect Codes in Cayley Graphs
- Efficient generation of all regular non-dominated coteries
- Perfect codes in circulant graphs
- Efficient 2-domination number in circulant graphs
- Characterizing subgroup perfect codes by 2-subgroups
- On subgroup perfect codes in Cayley sum graphs
- On regular sets in Cayley graphs
- Regular sets in circulant graphs with degree 3
- Perfect codes in 2-valent Cayley digraphs on abelian groups
- Classification of subgroup perfect codes in Cayley graphs
- On regular sets in Cayley sum graphs
- Subgroup (total) perfect codes of generalized Cayley graphs
- On efficient total colorings of regular graphs
- Subgroup perfect codes in Lie type simple groups of rank one
- Total colorings of k-regular graphs of girths 2k and k
- Perfect codes in proper intersection power graphs of finite groups
- Perfect codes in Cayley graphs of abelian groups
- Perfect codes in quintic Cayley graphs on abelian groups
- Subgroup perfect codes of simple N-groups
- Subgroup perfect codes in Cayley sum graphs
- Efficient domination in circulant graphs with two chord lengths
This page was built for publication: Efficient dominating sets in circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526230)
