Characterization of perfect Roman domination edge critical trees

DOI10.4418/2019.74.1.7MaRDI QIDQ5205520zbMATH OpenFDO

Authors A. Alhevaz, Mahsa Darkooti, Sadegh Rahimi, Hadi Rahbani

Publication date 12 December 2019

Full work available at URL https://doi.org/10.4418/2019.74.1.7

zbMATH Keywords

\( \gamma_{\mathrm{R}}^p\)-edge critical treesperfect Roman dominating function

Mathematics Subject Classification ID

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

Recommendations

• Perfect Roman domination in trees
• A characterization of perfect Roman trees
• Vertex and edge critical Roman domination in graphs
• On perfect Roman domination number in trees: complexity and bounds
• Roman domination edge critical graphs having precisely two cycles.

Cites work

• A Taxonomy of Perfect Domination
• Bounds on the locating Roman domination number in trees
• Characterization of Roman domination critical unicyclic graphs
• Critical concept for 2-rainbow domination in graphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 6470880 (Why is no real title available?)
• Perfect Roman domination in trees
• Properties of independent Roman domination in graphs
• Signed Roman domination in graphs
• Total roman domination in graphs
• Vertex and edge critical Roman domination in graphs

Cited in

(5)

• Perfect Roman domination in trees
• A characterization of perfect Roman trees
• Domination edge lift critical trees
• Perfect Roman domination in middle graphs
• Perfect Roman domination in regular graphs

This page was built for publication: Characterization of perfect Roman domination edge critical trees

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