Further results on the \([k]\)-Roman domination in graphs
From MaRDI portal
Publication:6563288
DOI10.1007/S41980-024-00872-1zbMATH Open1542.05142MaRDI QIDQ6563288
J. Carlos Valenzuela-Tripodoro, Maria Antonia Mateos-Camacho, Maria Pilar Álvarez-Ruiz, Martin Cera Lopez
Publication date: 27 June 2024
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Double Roman domination
- Roman domination in graphs.
- Mixed Roman domination in graphs
- Double Roman domination in generalized Petersen graphs
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- On the double Roman domination in graphs
- Triple Roman domination in graphs
- Extremal Problems for Roman Domination
- Double Roman domination and domatic numbers of graphs
- Quadruple Roman domination in graphs
- An upper bound on the double Roman domination number
- On [ k ] -Roman domination in graphs
Related Items (1)
This page was built for publication: Further results on the \([k]\)-Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563288)