Double Roman domination subdivision number in graphs

DOI10.1142/S179355712250125XzbMath1504.05208OpenAlexW3207155891MaRDI QIDQ5876741

No author found.

Publication date: 2 February 2023

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179355712250125x

zbMATH Keywords

NP-hardnessdouble Roman domination numberdouble Roman domination subdivision number

Mathematics Subject Classification ID

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

Related Items (1)

On [k-Roman domination subdivision number of graphs]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Double Roman domination
• Roman domination subdivision number of graphs
• Domination subdivision numbers of trees
• The Roman domatic problem in graphs and digraphs: a survey
• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• On the double Roman domination in graphs
• On \(k\)-independence in graphs with emphasis on trees
• Triple Roman domination in graphs
• Varieties of Roman Domination
• Roman Domination in Graphs
• Double Roman domination and domatic numbers of graphs
• Independent double Roman domination in graphs
• Varieties of Roman domination II
• Total Roman domination subdivision number in graphs
• Bounds on signed total double Roman domination
• An upper bound on the double Roman domination number

This page was built for publication: Double Roman domination subdivision number in graphs