Inverse double Roman domination in graphs
From MaRDI portal
Publication:6174775
DOI10.1142/s1793830922501440zbMath1516.05164OpenAlexW4297002463MaRDI QIDQ6174775
M. Kumara, V. Chaitra, Unnamed Author
Publication date: 15 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922501440
Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Double Roman domination
- Roman edge domination in graphs
- Inverse domination in graphs
- Some progress on the double Roman domination in graphs
- Some properties of double Roman domination
- On the double Roman domination in graphs
- INVERSE ROMAN DOMINATION IN GRAPHS
- Double Roman domination and domatic numbers of graphs
- The double Roman domination number of generalized Sierpiński graphs
- On the double Roman bondage numbers of graphs
This page was built for publication: Inverse double Roman domination in graphs