Regular sets in circulant graphs with degree 3
From MaRDI portal
Publication:6611005
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A NOTE ON REGULAR SETS IN CAYLEY GRAPHS
- An overview of \((\kappa, \tau)\)-regular sets and their applications
- Classification of efficient dominating sets of circulant graphs of degree 5
- Efficient dominating sets in Cayley graphs.
- Efficient dominating sets in circulant graphs
- Efficient dominating sets in circulant graphs with domination number prime
- Efficient domination in circulant graphs with two chord lengths
- Efficient open domination in Cayley graphs
- Existence of efficient total dominating sets of circulant graphs of degree 4
- Independent perfect domination sets in Cayley graphs
- On regular sets in Cayley graphs
- On subgroup regular sets in Cayley sum graphs
- Perfect codes in Cayley graphs
- Perfect codes in circulant graphs
- Regular sets in Cayley graphs
- Subgroup regular sets in Cayley graphs
- Subgroup total perfect codes in Cayley sum graphs
This page was built for publication: Regular sets in circulant graphs with degree 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611005)