Roman domination on 2-connected graphs

DOI10.1137/080733085zbMATH Open1245.05100OpenAlexW2147601521MaRDI QIDQ2902897FDOQ2902897

Authors: Chun-Hung Liu, Gerard Jennhwa Chang 

Publication date: 22 August 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6f5d75ed6ff78afe162aa0e71d2b45766d806b2c

Recommendations

• On the Roman domination number of a graph
• Extremal problems for roman domination
• A Nordhaus-Gaddum bound for Roman domination
• Roman domination in graphs.
• Note on 2-rainbow domination and Roman domination in graphs

zbMATH Keywords

dominationRoman domination2-connected graph

Mathematics Subject Classification ID

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

Cited In (26)

• Upper bounds on Roman domination numbers of graphs
• Total Roman domination in the lexicographic product of graphs
• 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
• Independent Roman domination and 2-independence in trees
• Difference between 2-rainbow domination and roman domination in graphs
• Global double Roman domination in graphs
• Graphs with large Italian domination number
• Total Roman reinforcement in graphs
• Data reductions and combinatorial bounds for improved approximation algorithms
• The Roman domination number of some special classes of graphs - convex polytopes
• On 2-rainbow domination and roman domination in graphs
• Edge Roman domination on graphs
• Perfect double Roman domination of trees
• A continuous generalization of domination-like invariants
• The \(k\)-th Roman domination problem is polynomial on interval graphs
• Domination parameters with number 2: interrelations and algorithmic consequences
• Mixed Roman domination and 2-independence in trees
• Vertex-addition strategy for domination-like invariants
• Minimal Roman dominating functions: extensions and enumeration
• Roman domination in graphs
• Perfect Italian domination in trees
• Approximation algorithm for a generalized Roman domination problem in unit ball graphs
• Italian domination in trees
• Exact algorithms for weak Roman domination

This page was built for publication: Roman domination on 2-connected graphs

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