Extremal digraphs for an upper bound on the double Roman domination number
From MaRDI portal
Publication:2305613
DOI10.1007/s40840-019-00735-7zbMath1434.05064OpenAlexW2913766006WikidataQ128438474 ScholiaQ128438474MaRDI QIDQ2305613
Mostafa Blidia, Lutz Volkmann, Lyes Ouldrabah, Ahmed Bouchou
Publication date: 11 March 2020
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-019-00735-7
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Double Roman domination
- Double Roman domination in trees
- Double Roman domination number
- Double Roman domination in digraphs
- On the double Roman domination of graphs
- On the double Roman domination in graphs
- Double Roman domination and domatic numbers of graphs
- An upper bound on the double Roman domination number