Extremal graphs for a bound on the Roman domination number
DOI10.7151/DMGT.2142zbMATH Open1439.05175OpenAlexW2883320500WikidataQ129514144 ScholiaQ129514144MaRDI QIDQ2175235FDOQ2175235
Authors: Ahmed Bouchou, Mostafa Blidia, Mustapha Chellali
Publication date: 28 April 2020
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2142
Recommendations
- Extremal digraphs for an upper bound on the Roman domination number
- Bounds on Roman domination numbers of graphs
- Upper bounds on Roman domination numbers of graphs
- Extremal digraphs for an upper bound on the double Roman domination number
- Bounds on the restrained Roman domination number of a graph
- scientific article; zbMATH DE number 6769213
- On maximal Roman domination in graphs
- On the Roman domination number of a graph
- On the strong Roman domination number of graphs
- On total Roman domination in graphs
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Roman domination in graphs.
- Extremal problems for roman domination
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Domination in graphs with minimum degree two
- Bounds on Roman domination numbers of graphs
- The differential and the roman domination number of a graph
Cited In (4)
This page was built for publication: Extremal graphs for a bound on the Roman domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175235)