scientific article; zbMATH DE number 7227817

MaRDI QIDQ3303772zbMATH OpenFDO

Authors V. Jude Annie Cynthia, A. Kavitha

Publication date 4 August 2020

Full work available at URL http://ijmcs.future-in-tech.net/15.2/R-Kavi.pdf

zbMATH Keywords

2-dominating number3-rainbow domination numbercirculant graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• 2-rainbow domination of circulant graphs \(C(n;\{1,2\})\)
• 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
• On the domination number of the circulant graphs \(C(n;\{1,2\})\), \(C(n;\{1,3\})\) and \(C(n;\{1,4\})\).
• On the 2-rainbow domination in graphs
• On rainbow domination numbers of graphs
• On the 2-rainbow independent domination numbers of some graphs
• Upper bound on 3-rainbow domination in graphs with minimum degree 2
• Dominator and total dominator coloring of circulant graph C_n(1, 2)
• Bounds on the 2-rainbow domination number of graphs
• A note on total domination and 2-rainbow domination in graphs

Cited in

(7)

• The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs
• 2-rainbow domination of circulant graphs \(C(n;\{1,2\})\)
• 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
• Generalized 3-rainbow domination in graphs and honeycomb system \((\mathrm{HC}(n))\)
• A characterization of graphs with global 3-rainbow domination number equal to the number of vertices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303772)