Mixed Roman domination in graphs

DOI10.1007/s40840-015-0141-1zbMath1386.05129OpenAlexW788806422MaRDI QIDQ1684257

J. Carlos Valenzuela-Tripodoro, Teresa W. Haynes, Hossein Abdollahzadeh Ahangar

Publication date: 8 December 2017

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-015-0141-1

zbMATH Keywords

Roman domination numberRoman dominating functionmixed Roman dominating functionmixed Roman domination number

Mathematics Subject Classification ID

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

Related Items (20)

Integer linear programming formulations for double roman domination problem ⋮ Unnamed Item ⋮ Outer independent Roman dominating functions in graphs ⋮ On trees with equal Roman domination and outer-independent Roman domination numbers ⋮ Further progress on the total Roman \(\{2\}\)-domination number of graphs ⋮ Triple Roman domination in graphs ⋮ Independent Roman domination and 2-independence in trees ⋮ On the double Roman domination in graphs ⋮ On the outer independent total double Roman domination in graphs ⋮ On the \(k\)-strong Roman domination problem ⋮ 2-Point set domination in separable graphs ⋮ On the total Roman domination in trees ⋮ Mixed Roman domination and 2-independence in trees ⋮ Some progress on the restrained Roman domination ⋮ Varieties of Roman domination II ⋮ Weakly connected Roman domination in graphs ⋮ Rainbow edge domination numbers in graphs ⋮ Outer-independent total Roman domination in graphs ⋮ On the double Roman domination of graphs ⋮ Total k-rainbow reinforcement number in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic complexity of mixed domination in graphs
• On total covers of graphs
• A linear algorithm for the domination number of a tree
• On total matching numbers and total covering numbers of complementary graphs
• Roman domination in graphs.
• On the mixed domination problem in graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Strong equality between the Roman domination and independent Roman domination numbers in trees
• The differential and the roman domination number of a graph
• An approximation algorithm for the total covering problem
• Total matchings and total coverings of graphs
• A note on the independent Roman domination in unicyclic graphs

This page was built for publication: Mixed Roman domination in graphs