On the 2-rainbow domination stable graphs
From MaRDI portal
Publication:2424728
DOI10.1007/s10878-018-0355-xzbMath1420.05116OpenAlexW2898649000WikidataQ129021835 ScholiaQ129021835MaRDI QIDQ2424728
Pu Wu, Zepeng Li, Zehui Shao, Taiyin Zhao
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0355-x
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Domination stability in graphs
- On rainbow domination numbers of graphs
- Domination alteration sets in graphs
- Total domination changing and stable graphs upon vertex removal
- Rainbow domination in graphs
- The diameter of total domination vertex critical graphs
- On the Roman domination stable graphs
- On the 2-rainbow domination in graphs
- Roman domination in graphs: The class ℛUV R
- Double domination critical and stable graphs upon vertex removal
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the 2-rainbow domination stable graphs