Double Roman domination in digraphs

DOI10.1007/s40840-017-0582-9zbMath1419.05091OpenAlexW2769897350MaRDI QIDQ2272602

Lutz Volkmann, Guoliang Hao, Xiaodan Chen

Publication date: 20 September 2019

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-017-0582-9

zbMATH Keywords

digraphsigned dominationRoman dominationdouble Roman domination\(k\)-dominationNordhaus-Gaddum-type inequality

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Integer linear programming formulations for double roman domination problem ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ Total double Roman domination numbers in digraphs ⋮ The double Roman domatic number of a digraph ⋮ Extremal digraphs for an upper bound on the double Roman domination number ⋮ The double Roman domination number of generalized Sierpiński graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Double Roman domination
• Directed domination in oriented graphs
• On the difference of the domination number of a digraph and of its reverse
• Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees
• Lower bounds on the signed domination numbers of directed graphs
• Bounds on the domination number of a digraph
• Independent rainbow domination of graphs
• Signed Roman domination in graphs
• Signed domination and signed domatic numbers of digraphs
• Signed domination numbers of directed graphs
• Extremal Problems for Roman Domination
• Lower bounds on the Roman and independent Roman domination numbers
• Dominating Set and Converse Dominating Set of a Directed Graph

This page was built for publication: Double Roman domination in digraphs