Upper bounds on Roman domination numbers of graphs

DOI10.1016/J.DISC.2011.12.021zbMATH Open1237.05154OpenAlexW2052351239MaRDI QIDQ764908FDOQ764908

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

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

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)

Cites Work

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

Cited In (37)

• Lower and upper bounds on the strong Roman dominator number in graphs
• Title not available (Why is that?)
• Total Roman domination in the lexicographic product of graphs
• On the Roman domination stable graphs
• Improved bounds on the \(k\)-tuple (Roman) domination number of a graph
• Roman domination on strongly chordal graphs
• The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)
• Minimal Roman dominating functions: extensions and enumeration
• A note on Roman domination of digraphs
• On the differential and Roman domination number of a graph with minimum degree two
• Title not available (Why is that?)
• Independent Roman domination and 2-independence in trees
• Extremal problems for roman domination
• Global double Roman domination in graphs
• Title not available (Why is that?)
• Graphs with large Italian domination number
• Total Roman reinforcement in graphs
• Title not available (Why is that?)
• Data reductions and combinatorial bounds for improved approximation algorithms
• The Roman domination number of some special classes of graphs - convex polytopes
• Extremal graphs for a bound on the Roman domination number
• Perfect double Roman domination of trees
• Bounds on the co-Roman domination number in graphs
• Extremal digraphs for an upper bound on the Roman domination number
• Mixed Roman domination and 2-independence in trees
• Roman domination problem with uncertain positioning and deployment costs
• Roman \(\{2\}\)-domination problem in graphs
• Title not available (Why is that?)
• Bounds on Roman domination numbers of graphs
• Minimal Roman dominating functions: extensions and enumeration
• Roman domination in graphs
• On the \(k\)-strong Roman domination problem
• Perfect Italian domination in trees
• Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
• A characterization of trees with equal Roman 2-domination and Roman domination numbers
• Italian domination in trees
• Roman domination in direct product graphs and rooted product 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)