Outer independent Roman domination number of trees

DOI10.22049/cco.2021.27072.1191zbMath1488.05372OpenAlexW3165810580MaRDI QIDQ4957568

No author found.

Publication date: 9 September 2021

Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14162_bc649d348f3b3863bd5517b8d106538d.pdf

zbMATH Keywords

treeouter independent Roman dominating functionouter independent Roman domination number

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Efficient algorithms for independent Roman domination on some classes of graphs ⋮ Varieties of Roman domination II

Cites Work

• Unnamed Item
• Unnamed Item
• Roman domination in graphs.
• Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
• The Roman domatic problem in graphs and digraphs: a survey
• A constructive characterization of vertex cover Roman trees
• Outer independent Roman dominating functions in graphs
• Varieties of Roman Domination
• Roman Domination in Graphs
• Varieties of Roman domination II
• On trees with equal Roman domination and outer-independent Roman domination numbers

This page was built for publication: Outer independent Roman domination number of trees