Upper bounds on Roman domination numbers of graphs
From MaRDI portal
Publication:764908
DOI10.1016/J.DISC.2011.12.021zbMath1237.05154OpenAlexW2052351239MaRDI QIDQ764908
Chun-Hung Liu, Gerard Jennhwa Chang
Publication date: 16 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.021
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (27)
A note on Roman domination of digraphs ⋮ A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers ⋮ Independent Roman domination and 2-independence in trees ⋮ On the Roman domination stable graphs ⋮ On the differential and Roman domination number of a graph with minimum degree two ⋮ Roman domination on strongly chordal graphs ⋮ Roman domination in direct product graphs and rooted product graphs ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Total Roman domination in the lexicographic product of graphs ⋮ Unnamed Item ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) ⋮ On the \(k\)-strong Roman domination problem ⋮ Graphs with large Italian domination number ⋮ Perfect Italian domination in trees ⋮ Italian domination in trees ⋮ Unnamed Item ⋮ Mixed Roman domination and 2-independence in trees ⋮ Roman Domination in Graphs ⋮ Roman domination in graphs: The class ℛUV R ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ Total Roman reinforcement in graphs ⋮ Perfect double Roman domination of trees ⋮ Roman domination problem with uncertain positioning and deployment costs ⋮ Extremal digraphs for an upper bound on the Roman domination number ⋮ Roman \(\{2\}\)-domination problem in graphs ⋮ Global double Roman domination in graphs
Cites Work
This page was built for publication: Upper bounds on Roman domination numbers of graphs
