Note on the independent Roman domination number of a graph

zbMATH Open1342.05103MaRDI QIDQ2809940FDOQ2809940

Authors: Nader Jafari Rad 

Publication date: 30 May 2016

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Recommendations

• Lower bounds on the roman and independent roman domination numbers
• Trees with independent Roman domination number twice the independent domination number
• Properties of independent Roman domination in graphs
• Bounds for independent Roman domination in graphs.
• A note on the independent Roman domination in unicyclic graphs

zbMATH Keywords

dominationRoman dominationindependent Roman domination

Mathematics Subject Classification ID

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

Cited In (14)

• On the Roman domination stable graphs
• Properties of independent Roman domination in graphs
• Lower bounds on the roman and independent roman domination numbers
• A note on the independent Roman domination in unicyclic graphs
• Relating the outer-independent total Roman domination number with some classical parameters of graphs
• A Roman domination chain
• Further results on the independent Roman domination number of graphs
• Varieties of Roman Domination
• Independent Roman \(\{2 \}\)-domination in graphs
• Roman domination perfect graphs
• Inverse roman domination in graphs
• Roman domination and independent Roman domination on graphs with maximum degree three
• Closed formulas for the independent (Roman) domination number of rooted product graphs
• Bounds for independent Roman domination in graphs.

This page was built for publication: Note on the independent Roman domination number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809940)