On the Roman domination subdivision number of a graph
From MaRDI portal
Publication:782761
DOI10.1007/S10878-020-00597-XzbMath1447.05153OpenAlexW3033257074MaRDI QIDQ782761
Mustapha Chellali, Zehui Shao, Jafar Amjadi, Rana Khoeilar
Publication date: 29 July 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00597-x
Related Items (3)
Triple Roman domination subdivision number in graphs ⋮ On [k-Roman domination subdivision number of graphs] ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman domination subdivision number of graphs
- Upper bounds for the Roman domination subdivision number of a graph
- Domination subdivision numbers of trees
- Disproof of a conjecture on the subdivision domination number of a graph
- Roman domination in graphs.
- The Roman domatic problem in graphs and digraphs: a survey
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Roman Domination in Graphs
- ON THE ROMAN BONDAGE NUMBER OF A GRAPH
- Varieties of Roman domination II
This page was built for publication: On the Roman domination subdivision number of a graph