Roman Domination on 2-Connected Graphs

DOI10.1137/080733085zbMath1245.05100OpenAlexW2147601521MaRDI QIDQ2902897

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

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)

Related Items (22)

Edge Roman domination on graphs ⋮ Vertex-addition strategy for domination-like invariants ⋮ Independent Roman domination and 2-independence in trees ⋮ Roman domination on strongly chordal graphs ⋮ Exact algorithms for weak Roman domination ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Total Roman domination in the lexicographic product of graphs ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) ⋮ Graphs with large Italian domination number ⋮ Perfect Italian domination in trees ⋮ Italian domination in trees ⋮ Mixed Roman domination and 2-independence in trees ⋮ Approximation algorithm for a generalized Roman domination problem in unit ball graphs ⋮ A continuous generalization of domination-like invariants ⋮ Roman Domination in Graphs ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ Total Roman reinforcement in graphs ⋮ Upper bounds on Roman domination numbers of graphs ⋮ Perfect double Roman domination of trees ⋮ Global double Roman domination in graphs

This page was built for publication: Roman Domination on 2-Connected Graphs