A Roman domination chain

DOI10.1007/S00373-015-1566-XzbMath1334.05098OpenAlexW1974455091MaRDI QIDQ5964976

Stephen T. Hedetniemi, Alice A. McRae, Sandra M. Hedetniemi, Teresa W. Haynes, Mustapha Chellali

Publication date: 2 March 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1566-x

zbMATH Keywords

Roman dominationRoman independenceRoman irredundanceRoman parameteres

Mathematics Subject Classification ID

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

Related Items (7)

Domination chain: characterisation, classical complexity, parameterised complexity and approximability ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ On the Complexity Landscape of the Domination Chain ⋮ The Private Neighbor Concept ⋮ Roman Domination in Graphs ⋮ A Nordhaus–Gaddum bound for Roman domination ⋮ On the roman domination number of generalized Sierpiński graphs

Cites Work

• Roman domination 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
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Properties of Hereditary Hypergraphs and Middle Graphs
• A note on the independent Roman domination in unicyclic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Roman domination chain