The Roman domination number of some special classes of graphs - convex polytopes
DOI10.2298/AADM171211019KzbMATH Open1499.05470OpenAlexW3163231918MaRDI QIDQ3390794FDOQ3390794
Authors: Aleksandar Kartel, Milana Grbić, Dragan Matić, V. Filipovic 
Publication date: 25 March 2022
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm171211019k
Recommendations
- On the Roman domination number of a graph
- On the Roman domination polynomial of graphs
- scientific article; zbMATH DE number 7266465
- Bounds on Roman domination numbers of graphs
- On the Roman domination subdivision number of a graph
- On the Roman edge domination number of a graph
- Roman \(k\)-domination in graphs
- On the strong Roman domination number of graphs
- On the roman domination number of generalized Sierpiński graphs
- On total Roman domination in graphs
Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Roman domination in graphs.
- On 2-rainbow domination and roman domination in graphs
- Extremal problems for roman domination
- Few compare to the great Roman Empire
- On families of convex polytopes with constant metric dimension
- Roman domination in regular graphs
- On the Roman domination number of a graph
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Roman domination on strongly chordal graphs
- A characterization of Roman trees
- On roman, global and restrained domination in graphs
- A note on Roman domination in graphs
- The Roman domination number of a digraph
- Bounds on Roman domination numbers of graphs
- Graph-Theoretic Concepts in Computer Science
- The differential and the roman domination number of a graph
- Roman domination on 2-connected graphs
- Coloring, location and domination of corona graphs
- Upper bounds on Roman domination numbers of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the roman domination number of generalized Sierpiński graphs
- Improved mixed integer linear programing formulations for Roman domination problem
- Some results for roman domination number on cardinal product of paths and cycles
- On the Roman domination numbers of generalized Petersen graphs
- Roman domination number on cardinal product of paths and cycles
Cited In (3)
This page was built for publication: The Roman domination number of some special classes of graphs - convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390794)
