The Roman domination number of some special classes of graphs - convex polytopes
From MaRDI portal
Publication:3390794
DOI10.2298/AADM171211019KzbMath1499.05470OpenAlexW3163231918MaRDI QIDQ3390794
Aleksandar Kartel, Dragan Matić, Vladimir Filipović, Milana Grbić
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
Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coloring, location and domination of corona graphs
- Roman domination on strongly chordal graphs
- On families of convex polytopes with constant metric dimension
- On roman, global and restrained domination in graphs
- Upper bounds on Roman domination numbers of graphs
- A note on Roman domination in graphs
- Roman domination in regular graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Roman Domination on 2-Connected Graphs
- Roman domination number on cardinal product of paths and cycles
- The differential and the roman domination number of a graph
- Some results for Roman domination number on Cardinal product of paths and cycles
- Extremal Problems for Roman Domination
- A characterization of Roman trees
- On the roman domination number of generalized Sierpiński graphs
- Improved mixed integer linear programing formulations for roman domination problem
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: The Roman domination number of some special classes of graphs - convex polytopes
