Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On the double Roman domination in graphs - MaRDI portal

On the double Roman domination in graphs

From MaRDI portal
Publication:2410217

DOI10.1016/j.dam.2017.06.014zbMath1372.05153OpenAlexW2744781146MaRDI QIDQ2410217

Mustapha Chellali, Hossein Abdollahzadeh Ahangar, Seyyed Mahmoud Sheikholeslami

Publication date: 17 October 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.06.014




Related Items (56)

Total double Roman domination in graphsBounds on signed total double Roman dominationInteger linear programming formulations for double roman domination problemA new approach on locally checkable problemsAlgorithmic aspects of total Roman and total double Roman domination in graphsUnnamed ItemOuter independent signed double Roman dominationDouble Roman domination in generalized Petersen graphsSigned double roman domination of graphsComplexity aspects of variants of independent Roman domination in graphsOn the global double Roman domination of graphsRoman \(k\)-domination: hardness, approximation and parameterized resultsAn improved upper bound on the independent double Roman domination number of treesOn the D-differential of a graphRoman \(\{ 3 \}\)-domination (double Italian domination)On the double Roman bondage numbers of graphsDisprove of a conjecture on the double Roman domination numberThe double Roman domatic number of a digraphOn the independent double Roman domination in graphsPerfect double Italian domination of a graphOn the \(k\)-strong Roman domination problemOn algorithmic complexity of double Roman dominationInverse double Roman domination in graphsIndependent double Roman domination in graphsUnnamed ItemSigned double Roman domination in graphsA note on the double Roman domination number of graphsAn upper bound on the double Roman domination numberA characterization of double Roman treesAlgorithmic aspects of certified domination in graphsMaximal double Roman domination in graphsDouble Roman domination numberAn upper bound on the double Roman domination numberSome progress on the restrained Roman dominationOuter independent double Roman dominationVarieties of Roman domination IIComplexity of Roman {2}-domination and the double Roman domination in graphsAlgorithmic results on double Roman domination in graphsSigned total double Roman k-domination in graphsA linear algorithm for double Roman domination of proper interval graphsVarieties of Roman DominationExtremal digraphs for an upper bound on the double Roman domination numberDouble Roman domination and domatic numbers of graphsProperties of double Roman domination on cardinal products of graphsPerfect double Roman domination of treesBounds for signed double Roman k-domination in treesUnnamed ItemAn improved upper bound on the double Roman domination number of graphs with minimum degree at least twoOn the double Roman domination of graphsCritical concept for double Roman domination in graphsDouble Roman reinforcement number in graphsALGORITHMIC ASPECTS OF ROMAN GRAPHSDouble Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycleDouble Roman domination subdivision number in graphsGlobal double Roman domination in graphsAlgorithm and hardness results in double Roman domination of graphs



Cites Work


This page was built for publication: On the double Roman domination in graphs