Upper bounds on Roman domination numbers of graphs

DOI10.1016/J.DISC.2011.12.021MaRDI QIDQ764908zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

minimum degreedominationRoman dominationforbidden subgraphcocomparability graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Extremal problems for roman domination
• Roman domination in graphs.
• Bounds on Roman domination numbers of graphs
• On the Roman domination number of a graph
• Roman bondage in graphs

Cites work

• A characterization of Roman trees
• A note on Roman domination in graphs
• Extremal problems for roman domination
• Graph-Theoretic Concepts in Computer Science
• Graphs with a cycle of length divisible by three
• Roman domination in graphs.
• Roman domination on 2-connected graphs

Cited in

(39)

• Improved bounds on the \(k\)-tuple (Roman) domination number of a graph
• Roman domination on strongly chordal graphs
• Roman domination in direct product graphs and rooted product graphs
• Extremal digraphs for an upper bound on the Roman domination number
• Minimal Roman dominating functions: extensions and enumeration
• Lower and upper bounds on the strong Roman dominator number in graphs
• Perfect double Roman domination of trees
• A note on Roman domination of digraphs
• On the Roman domination stable graphs
• The Roman domination number of some special classes of graphs - convex polytopes
• Roman domination problem with uncertain positioning and deployment costs
• On the differential and Roman domination number of a graph with minimum degree two
• On the \(k\)-strong Roman domination problem
• Perfect Italian domination in trees
• scientific article; zbMATH DE number 7509363 (Why is no real title available?)
• Global double Roman domination in graphs
• The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)
• Data reductions and combinatorial bounds for improved approximation algorithms
• scientific article; zbMATH DE number 7589547 (Why is no real title available?)
• Total Roman reinforcement in graphs
• An upper bound on triple Roman domination
• Extremal graphs for a bound on the Roman domination number
• Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
• Minimal Roman dominating functions: extensions and enumeration
• Roman domination in graphs
• A characterization of trees with equal Roman 2-domination and Roman domination numbers
• Independent Roman domination and 2-independence in trees
• Italian domination in trees
• Graphs with large Italian domination number
• The generous Roman domination number
• scientific article; zbMATH DE number 7478539 (Why is no real title available?)
• Roman \(\{2\}\)-domination problem in graphs
• scientific article; zbMATH DE number 2094533 (Why is no real title available?)
• scientific article; zbMATH DE number 6769213 (Why is no real title available?)
• Bounds on the co-Roman domination number in graphs
• Bounds on Roman domination numbers of graphs
• Extremal problems for roman domination
• Mixed Roman domination and 2-independence in trees
• Total Roman domination in the lexicographic product of graphs

This page was built for publication: Upper bounds on Roman domination numbers of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764908)