Strong equality between the Roman domination and independent Roman domination numbers in trees

DOI10.7151/DMGT.1669zbMath1293.05258OpenAlexW2031491044MaRDI QIDQ2860863

Mustapha Chellali, Nader Jafari Rad

Publication date: 11 November 2013

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1669

zbMATH Keywords

Roman dominationstrong equalityindependent Roman domination

Mathematics Subject Classification ID

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

Related Items (14)

Strong equality of Roman and weak Roman domination in trees ⋮ A note on Roman domination of digraphs ⋮ Some progress on the double Roman domination in graphs ⋮ Double Roman domination ⋮ Complexity aspects of variants of independent Roman domination in graphs ⋮ Mixed Roman domination in graphs ⋮ Further results on the independent Roman domination number of graphs ⋮ Closed formulas for the independent (Roman) domination number of rooted product graphs ⋮ Efficient algorithms for independent Roman domination on some classes of graphs ⋮ Double Roman domination number ⋮ Independent roman $\{3\}$-domination ⋮ Unicyclic graphs with strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers ⋮ A Roman domination chain ⋮ Varieties of Roman Domination

This page was built for publication: Strong equality between the Roman domination and independent Roman domination numbers in trees