Rainbow domination in Cartesian product of paths and cycles
From MaRDI portal
Publication:6660952
DOI10.1142/S0129054123500272MaRDI QIDQ6660952
Hong Gao, Changqing Xi, Yu-Qi Wang, Yuansheng Yang, Y. L. Zhang, Xing Liu, Renbang Liu, Yuanyuan Guo
Publication date: 10 January 2025
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- On the rainbow domination number of digraphs
- Bounds on the 2-rainbow domination number of graphs
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
- On rainbow domination numbers of graphs
- The Cartesian product of cycles with small 2-rainbow domination number
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Rainbow domination on trees
- Upper bound on 3-rainbow domination in graphs with minimum degree 2
- General bounds on rainbow domination numbers
- On the 2-rainbow domination stable graphs
- A tight upper bound for 2-rainbow domination in generalized Petersen graphs
This page was built for publication: Rainbow domination in Cartesian product of paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660952)
