Extremal digraphs for an upper bound on the Roman domination number

DOI10.1007/s10878-019-00401-5zbMath1429.05157OpenAlexW2924583658WikidataQ128208333 ScholiaQ128208333MaRDI QIDQ2331577

Ahmed Bouchou, Mostafa Blidia, Lyes Ouldrabah

Publication date: 29 October 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00401-5

zbMATH Keywords

digraphoriented graphtournamentRoman domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Roman domination in oriented trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds on Roman domination numbers of graphs
• On the Roman domination number of a graph
• Roman domination in graphs.
• A note on Roman domination of digraphs
• Extremal problems on weak Roman domination number
• Extremal Problems for Roman Domination

This page was built for publication: Extremal digraphs for an upper bound on the Roman domination number