Lower bounds on the Roman and independent Roman domination numbers
From MaRDI portal
Publication:5279868
DOI10.2298/AADM151112023CzbMath1461.05154OpenAlexW2344417619MaRDI QIDQ5279868
Stephen T. Hedetniemi, Mustapha Chellali, Teresa W. Haynes
Publication date: 19 July 2017
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm151112023c
Related Items (10)
A note on the bounds of Roman domination numbers ⋮ Independent Roman domination and 2-independence in trees ⋮ On the signed Roman \(k\)-domination: complexity and thin torus graphs ⋮ Further results on the independent Roman domination number of graphs ⋮ Closed formulas for the independent (Roman) domination number of rooted product graphs ⋮ Double Roman domination in digraphs ⋮ Varieties of Roman Domination ⋮ Roman Domination in Graphs ⋮ Total Roman domination in digraphs ⋮ Trees with equal Roman {2}-domination number and independent Roman {2}-domination number
This page was built for publication: Lower bounds on the Roman and independent Roman domination numbers