Trees with unique Roman dominating functions of minimum weight

DOI10.1142/S1793830914500384zbMath1298.05244OpenAlexW2086075607MaRDI QIDQ2920886

Mustapha Chellali, Nader Jafari Rad

Publication date: 29 September 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830914500384

zbMATH Keywords

treeRoman domination

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items (7)

Vertex-Edge Roman Domination ⋮ On the Roman domination stable graphs ⋮ Unnamed Item ⋮ Roman Domination in Graphs ⋮ Roman domination in graphs: The class ℛUV R ⋮ On trees with domination number equal to edge-vertex roman domination number ⋮ Trees with vertex-edge roman domination number twice the domination number minus one

Cites Work

• Defending the Roman Empire from multiple attacks
• Roman domination in graphs.
• Trees with unique minimum total dominating sets
• A characterization of Roman trees

This page was built for publication: Trees with unique Roman dominating functions of minimum weight