On perfect Roman domination number in trees: complexity and bounds

DOI10.1007/s10878-019-00408-yzbMath1429.05154OpenAlexW2938543720MaRDI QIDQ2331583

Mahsa Darkooti, Hadi Rahbani, Sadegh Rahimi, Abdollah 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 setRoman dominating functionperfect Roman dominating function

Mathematics Subject Classification ID

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

Related Items (8)

Perfect Roman domination in middle graphs ⋮ A new upper bound for the perfect Italian domination number of a tree ⋮ On the perfect differential of a graph ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ Perfect double Italian domination of a graph ⋮ Unnamed Item ⋮ Note on the perfect Roman domination number of graphs ⋮ Varieties of Roman Domination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Perfect Roman domination in trees
• Signed Roman domination in graphs
• Extremal Problems for Roman Domination
• ROMAN k-DOMINATION IN GRAPHS
• A Taxonomy of Perfect Domination
• Total Roman domination in graphs

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