On perfect Roman domination number in trees: complexity and bounds

DOI10.1007/S10878-019-00408-YMaRDI QIDQ2331583zbMATH OpenOpenAlexFDO

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

Publication date 29 October 2019

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-019-00408-y

zbMATH Keywords

dominating setperfect Roman dominating functionRoman dominating function

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Perfect Roman domination in trees
• Perfect Roman domination in graphs
• Perfect double Roman domination of trees
• Complexity issues of perfect Roman domination in graphs
• On the computational complexity aspects of perfect Roman domination

Cites work

• A Taxonomy of Perfect Domination
• Edge roman domination in graphs
• Extremal problems for roman domination
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Perfect Roman domination in trees
• Properties of independent Roman domination in graphs
• Roman \(\{2 \}\)-domination
• Roman \(k\)-domination in graphs
• Signed Roman domination in graphs
• Total roman domination in graphs

Cited in

(19)

• Perfect Roman domination in trees
• A new upper bound for the perfect Italian domination number of a tree
• A characterization of perfect Roman trees
• A constructive characterization of vertex cover Roman trees
• Note on the perfect Roman domination number of graphs
• Perfect Roman domination in graphs
• Varieties of Roman Domination
• On the computational complexity aspects of perfect Roman domination
• Perfect Roman domination in middle graphs
• Complexity issues of perfect Roman domination in graphs
• Strong equality of Roman and perfect Roman domination in trees
• On the perfect differential of a graph
• Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
• Perfect Roman domination in regular graphs
• Characterization of perfect Roman domination edge critical trees
• Perfect double Italian domination of a graph
• On the perfect differential and perfect Roman domination in complementary prisms
• Roman domination parameters with respect to differentials in probabilistic neural networks
• Constructive characterizations concerning weak Roman domination in trees

This page was built for publication: On perfect Roman domination number in trees: complexity and bounds

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