A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers

DOI10.22049/CCO.2019.26364.1103zbMath1438.05188OpenAlexW2945814075MaRDI QIDQ5242940

Ismael González Yero, Abel Cabrera Martínez

Publication date: 8 November 2019

Full work available at URL: https://doaj.org/article/abf9dc9bc0af4744a0b2d8e61ad5ff68

zbMATH Keywords

treeRoman domination2-rainbow dominationRoman \{2\}-domination

Mathematics Subject Classification ID

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

Related Items (4)

Construction for trees without domination critical vertices ⋮ Unnamed Item ⋮ Varieties of Roman Domination ⋮ Constructive characterizations concerning weak Roman domination in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Italian domination in trees
• Upper bounds on Roman domination numbers of graphs
• Rainbow domination in graphs
• On the Roman domination number of a graph
• Roman domination in graphs.
• Relating 2-rainbow domination to Roman domination
• A characterization of Roman trees
• Roman domination in Cartesian product graphs and strong product graphs

This page was built for publication: A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers