Perfect double Roman domination of trees

DOI10.1016/J.DAM.2020.03.021MaRDI QIDQ777364zbMATH OpenOpenAlexFDO

Authors Ayotunde T. Egunjobi, Teresa W. Haynes

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

zbMATH Keywords

Roman dominationdouble Roman dominationperfect double Roman domination

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Perfect Roman domination in trees
• Characterization of double Roman trees.
• Double Roman domination
• A characterization of double Roman trees
• Double Roman trees.

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• A Taxonomy of Perfect Domination
• A characterization of Roman trees
• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• An upper bound on the double Roman domination number
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Double Roman domination
• Double Roman domination and domatic numbers of graphs
• Double Roman domination in trees
• Double Roman domination number
• Extremal problems for roman domination
• On the Roman domination number of a graph
• On the double Roman domination in graphs
• On the double Roman domination of graphs
• Perfect Italian domination in trees
• Perfect Roman domination in trees
• Roman domination in Cartesian product graphs and strong product graphs
• Roman domination in graphs.
• Roman domination number of the Cartesian products of paths and cycles
• Roman domination on 2-connected graphs
• Roman domination on strongly chordal graphs
• Roman domination perfect graphs
• Some progress on the double Roman domination in graphs
• The differential and the roman domination number of a graph
• Total domination in graphs
• Upper bounds on Roman domination numbers of graphs

Cited in

(8)

• On perfect Roman domination number in trees: complexity and bounds
• Perfect double Italian domination of a graph
• A new approach on locally checkable problems
• On \(d\)-stable locally checkable problems parameterized by mim-width
• A characterization of graphs with global 3-rainbow domination number equal to the number of vertices
• Perfect Roman domination in trees
• A characterization of perfect Roman trees
• scientific article; zbMATH DE number 6815662 (Why is no real title available?)

This page was built for publication: Perfect double Roman domination of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777364)