On 2-rainbow domination number of functigraph and its complement
From MaRDI portal
Publication:4987017
DOI10.7494/OPMATH.2020.40.5.617zbMATH Open1462.05286MaRDI QIDQ4987017FDOQ4987017
Authors: Athena Shaminezhad, Ebrahim Vatandoost
Publication date: 28 April 2021
Published in: Opuscula Mathematica (Search for Journal in Brave)
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)
Cites Work
- Difference between 2-rainbow domination and roman domination in graphs
- On the 2-rainbow domination in graphs
- Averaging 2-rainbow domination and Roman domination
- Bounds on the 2-rainbow domination number of graphs
- Title not available (Why is that?)
- Rainbow domination in graphs
- Rainbow domination on trees
- Maximal 2-rainbow domination number of a graph
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
- On the roman domination number of generalized Sierpiński graphs
- On 2-rainbow domination of generalized Petersen graphs
- On \(k\)-rainbow independent domination in graphs
- A note on total domination and 2-rainbow domination in graphs
- Domination and signed domination number of Cayley graphs
Cited In (3)
This page was built for publication: On 2-rainbow domination number of functigraph and its complement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987017)