The 2-rainbow bondage number in generalized Petersen graphs
From MaRDI portal
Publication:5193416
DOI10.1080/23311835.2017.1326203zbMath1426.05135OpenAlexW2614896564MaRDI QIDQ5193416
Yue-Li Wang, Jia-Jie Liu, Kuo-Hua Wu, Chiun-Chieh Hsu
Publication date: 10 September 2019
Published in: Cogent Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/23311835.2017.1326203
Cites Work
- The \(k\)-rainbow bondage number of a graph
- Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Rainbow domination on trees
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- A tight upper bound for 2-rainbow domination in generalized Petersen graphs
- On the 2-rainbow domination in graphs
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Self-dual configurations and regular graphs
This page was built for publication: The 2-rainbow bondage number in generalized Petersen graphs