The roman domatic number of a graph
From MaRDI portal
Publication:990809
DOI10.1016/J.AML.2010.06.016zbMATH Open1193.05129OpenAlexW2077686450MaRDI QIDQ990809FDOQ990809
Seyed Mahmood Sheikholeslami, Lutz Volkmann
Publication date: 1 September 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2010.06.016
Cites Work
Cited In (14)
- The Roman domatic problem in graphs and digraphs: a survey
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Roman Domination in Graphs
- Computing Roman domatic number of graphs
- The roman \(k\)-domatic number of a graph
- Double Roman domination and domatic numbers of graphs
- The Roman \(\{2 \}\)-domatic number of graphs
- The distance Roman domatic number of a graph
- The signed edge-domatic number of nearly cubic graphs
- Domination-related parameters in middle graphs
- Title not available (Why is that?)
- Restrained Roman and restrained Italian domatic numbers of graphs
- On the \(k\)-strong Roman domination problem
- A note on the Roman domatic number of a digraph
This page was built for publication: The roman domatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990809)