2-rainbow domination of circulant graphs C(n;\1,2\)
From MaRDI portal
Publication:2815792
Recommendations
Cited in
(7)- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs
- scientific article; zbMATH DE number 7227817 (Why is no real title available?)
- Bounds on the 3-rainbow domination
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
- The integer \(\{k\}\)-domination number of circulant graphs
- On \(k\)-rainbow domination in regular graphs
- Rainbow domination in graphs
This page was built for publication: 2-rainbow domination of circulant graphs \(C(n;\{1,2\})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815792)