Perfect Roman domination in trees
From MaRDI portal
Publication:1693150
DOI10.1016/j.dam.2017.10.027zbMath1377.05141OpenAlexW2770344522MaRDI QIDQ1693150
William F. Klostermeyer, Michael A. Henning, Gary MacGillivray
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.10.027
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (21)
Perfect Roman domination in middle graphs ⋮ Unnamed Item ⋮ A new upper bound for the perfect Italian domination number of a tree ⋮ On the perfect differential of a graph ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs ⋮ Perfect Italian domination in cographs ⋮ Unique response Roman domination: complexity and algorithms ⋮ Perfect double Italian domination of a graph ⋮ A characterization of perfect Roman trees ⋮ Graphs with large Italian domination number ⋮ A characterization of double Roman trees ⋮ Perfect Italian domination in trees ⋮ Perfect roman domination in regular graphs ⋮ Unnamed Item ⋮ Zero forcing versus domination in cubic graphs ⋮ Note on the perfect Roman domination number of graphs ⋮ Varieties of Roman Domination ⋮ Perfect double Roman domination of trees ⋮ On perfect Roman domination number in trees: complexity and bounds ⋮ Perfect Roman domination in graphs
Cites Work
This page was built for publication: Perfect Roman domination in trees
