Further results on the [k]-Roman domination in graphs
From MaRDI portal
Publication:6563288
DOI10.1007/S41980-024-00872-1zbMATH Open1542.05142MaRDI QIDQ6563288FDOQ6563288
Authors: J. Carlos Valenzuela-Tripodoro, Maria Antonia Mateos-Camacho, Martin Cera Lopez, Maria Pilar Álvarez-Ruiz
Publication date: 27 June 2024
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Roman domination in graphs.
- Extremal problems for roman domination
- Double Roman domination
- On the double Roman domination in graphs
- Double Roman domination and domatic numbers of graphs
- Triple Roman domination in graphs
- Mixed Roman domination in graphs
- Title not available (Why is that?)
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Double Roman domination in generalized Petersen graphs
- Quadruple Roman domination in graphs
- An upper bound on the double Roman domination number
- Title not available (Why is that?)
- On [ k ] -Roman domination in graphs
Cited In (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)