Roman domination and independent Roman domination on graphs with maximum degree three
From MaRDI portal
Publication:6124437
DOI10.1016/j.dam.2024.02.006OpenAlexW4391869991MaRDI QIDQ6124437
Publication date: 27 March 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2024.02.006
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On snarks that are far from being 3-edge colorable
- Roman domination in subgraphs of grids
- Roman domination in regular graphs
- Construction of class two graphs with maximum vertex degree three
- Roman domination in graphs.
- Face covers and the genus problem for apex graphs
- Snarks without small cycles
- The Roman domatic problem in graphs and digraphs: a survey
- Domination number of graphs with minimum degree five
- Complexity aspects of variants of independent Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Roman domination number of Generalized Petersen Graphs P(n,2)
- Varieties of Roman Domination
- Roman Domination in Graphs
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Independent Roman domination and 2-independence in trees
- A note on the independent Roman domination in unicyclic graphs
- Varieties of Roman domination II
- Domination in Graphs: Core Concepts
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- Perfect roman domination in regular graphs
- Roman domination in Cartesian product graphs and strong product graphs
This page was built for publication: Roman domination and independent Roman domination on graphs with maximum degree three
