Total Roman domination in graphs
From MaRDI portal
Publication:5279897
DOI10.2298/AADM160802017AzbMath1461.05151OpenAlexW2504650782MaRDI QIDQ5279897
V. Samodivkin, Ismael González Yero, Michael A. Henning, Hossein Abdollahzadeh Ahangar
Publication date: 19 July 2017
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm160802017a
Related Items (48)
Total double Roman domination in graphs ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Relating the outer-independent total Roman domination number with some classical parameters of graphs ⋮ Unnamed Item ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ On the total and strong version for Roman dominating functions in graphs ⋮ Roman domination in direct product graphs and rooted product graphs ⋮ On the outer independent total double Roman domination in graphs ⋮ Total Roman domination on the digraphs ⋮ Total Roman domination in the lexicographic product of graphs ⋮ Quasi-total Roman reinforcement in graphs ⋮ Bounds on the locating Roman domination number in trees ⋮ On the \(k\)-strong Roman domination problem ⋮ Nordhaus-Gaddum bounds for total Roman domination ⋮ Global total Roman domination in graphs ⋮ Relating the total \(\{2\}\)-domination number with the total domination number of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the co-Roman domination in graphs ⋮ On the total Roman domination in trees ⋮ Total 2-rainbow domination numbers of trees ⋮ A characterization of double Roman trees ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ A Note on Roman $k$-tuple domination number ⋮ Double Roman domination number ⋮ Quasi-total Roman domination in graphs ⋮ Graphs with large total 2-rainbow domination number ⋮ Reinforcement number of a graph with respect to half-domination ⋮ Total Roman domination for proper interval graphs ⋮ Total Roman domination edge-critical graphs ⋮ Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs ⋮ Varieties of Roman Domination ⋮ Closed formulas for the total Roman domination number of lexicographic product graphs ⋮ Algorithmic and complexity aspects of problems related to total Roman domination for graphs ⋮ Total Roman reinforcement in graphs ⋮ Total Roman domatic number of a graph ⋮ Total Roman domination in digraphs ⋮ Total Roman {2}-domination in graphs ⋮ A matheuristic approach for solving the 2-connected dominating set problem ⋮ Weakly connected Roman domination in graphs ⋮ Double domination in lexicographic product graphs ⋮ Outer-independent total Roman domination in graphs ⋮ On perfect Roman domination number in trees: complexity and bounds ⋮ The double Roman domination number of generalized Sierpiński graphs ⋮ On the total Roman domination stability in graphs ⋮ Total Roman domination subdivision number in graphs
This page was built for publication: Total Roman domination in graphs
