Note on the independent Roman domination number of a graph

MaRDI QIDQ2809940zbMATHFDO

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)

zbMATH Keywords

dominationRoman dominationindependent Roman domination

Mathematics Subject Classification ID

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

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

Cited in

(14)

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

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)