Edge Roman domination on graphs

DOI10.1007/S00373-016-1695-XzbMath1351.05168arXiv1405.5622OpenAlexW2147353440MaRDI QIDQ343714

Chun-Hung Liu, Sheng-Hua Chen, Gerard Jennhwa Chang

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.5622

zbMATH Keywords

planar graphsubcubic graph\(K_{2,3}\)-subdivision-free graph\(k\)-degenerate graphedge Roman domination

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) ⋮ A characterization of double Roman trees ⋮ Varieties of Roman Domination ⋮ A note on the edge Roman domination in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Roman domination on strongly chordal graphs
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
• Graphs with a cycle of length divisible by three
• Global Roman domination in trees
• Signed Roman domination in graphs
• Roman Domination on 2-Connected Graphs
• Extremal Problems for Roman Domination

This page was built for publication: Edge Roman domination on graphs