Varieties of Roman domination II

From MaRDI portal
Publication:4956207

DOI10.1016/j.akcej.2019.12.001zbMath1468.05202OpenAlexW4214937823MaRDI QIDQ4956207

Lutz Volkmann, Nader Jafari Rad, Mustapha Chellali, Seyyed Mahmoud Sheikholeslami

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2019.12.001




Related Items (52)

Bounds on signed total double Roman dominationOuter independent Roman domination number of treesComplexity of signed total \(k\)-Roman domination problem in graphsOn the Italian reinforcement number of a digraphOn the outer-independent double Italian domination numberOuter independent signed double Roman dominationThe Roman domatic problem in graphs and digraphs: a surveyA new upper bound for the perfect Italian domination number of a treeFurther progress on the total Roman \(\{2\}\)-domination number of graphsBounds on the double Italian domination number of a graphOn the total and strong version for Roman dominating functions in graphsOn the outer independent total double Roman domination in graphsTriple Roman domination subdivision number in graphsGraphs whose weak Roman domination number increases by the deletion of any edgeTotal Italian domatic number of graphsQuasi-total Roman bondage number in graphsOn [k-Roman domination subdivision number of graphs] ⋮ Further results on independent double roman treesQuasi-total Roman reinforcement in graphsDisprove of a conjecture on the double Roman domination numberRoman domination and independent Roman domination on graphs with maximum degree threeOn [ k -Roman domination in graphs] ⋮ On algorithmic complexity of double Roman dominationNew results on quadruple Roman domination in graphsUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemMaximal double Roman domination in graphsOn the Zagreb indices of graphs with given Roman domination numberAn upper bound on the double Roman domination numberA proof of a conjecture on the differential of a subcubic graphTotal Roman \(\{2\}\)-reinforcement of graphsVarieties of Roman DominationProperties of double Roman domination on cardinal products of graphsRestrained Roman and restrained Italian domatic numbers of graphsComputing strong Roman domination of trees and unicyclic graphs in linear timeOn the Roman domination subdivision number of a graphRemarks on the outer-independent double Italian domination numberOn the total Roman domination stability in graphsDouble Roman reinforcement number in graphsQuadruple Roman domination in graphsEdge lifting and Roman domination in graphsDouble Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycleDouble Roman domination subdivision number in graphsAlgorithm and hardness results in double Roman domination of graphs



Cites Work


This page was built for publication: Varieties of Roman domination II