Perfect double Roman domination of trees
From MaRDI portal
Publication:777364
DOI10.1016/j.dam.2020.03.021zbMath1442.05153OpenAlexW2941919973MaRDI QIDQ777364
Teresa W. Haynes, Ayotunde T. Egunjobi
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://dc.etsu.edu/cgi/viewcontent.cgi?article=5044&context=etd
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
A new approach on locally checkable problems, Perfect double Italian domination of a graph, On \(d\)-stable locally checkable problems parameterized by mim-width
Cites Work
- Unnamed Item
- Unnamed Item
- Double Roman domination
- Roman domination on strongly chordal graphs
- Roman domination number of the Cartesian products of paths and cycles
- Upper bounds on Roman domination numbers of graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- Some progress on the double Roman domination in graphs
- Perfect Roman domination in trees
- Double Roman domination in trees
- Perfect Italian domination in trees
- Double Roman domination number
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- On the double Roman domination of graphs
- On the double Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Roman Domination on 2-Connected Graphs
- The differential and the roman domination number of a graph
- Extremal Problems for Roman Domination
- A characterization of Roman trees
- Double Roman domination and domatic numbers of graphs
- Total Domination in Graphs
- A Taxonomy of Perfect Domination
- Roman domination in Cartesian product graphs and strong product graphs
- An upper bound on the double Roman domination number
