Bounds for independent Roman domination in graphs.

zbMATH Open1247.05154MaRDI QIDQ2895353FDOQ2895353

Authors: E. Ebrahimi Targhi, Nader Jafari Rad, Christina M. Mynhardt, Y. Wu 

Publication date: 2 July 2012

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

Recommendations

• Note on the independent Roman domination number of a graph
• Lower bounds on the roman and independent roman domination numbers
• Independent Roman domination and 2-independence in trees
• Trees with independent Roman domination number twice the independent domination number
• Further results on the independent Roman domination number of graphs

zbMATH Keywords

dominationRoman dominationindependent Roman domination number

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cited In (12)

• Note on the independent Roman domination number of a graph
• Independent Roman bondage of 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
• Independent Roman domination and 2-independence in trees
• Trees with independent Roman domination number twice the independent domination number
• A Roman domination chain
• Further results on the independent Roman domination number of graphs
• Mixed Roman domination in graphs
• Varieties of Roman Domination
• Lower and upper bounds on independent double Roman domination in trees

This page was built for publication: Bounds for independent Roman domination in graphs.

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