Co-Roman domination in graphs

DOI10.1007/s12044-015-0209-8zbMath1312.05103OpenAlexW2078192565MaRDI QIDQ2344075

Martín Manrique, Karam Ebadi, S. Arumugam

Publication date: 12 May 2015

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12044-015-0209-8

zbMATH Keywords

dominationRoman dominationweak Roman dominationco-Roman domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Extremal problems on weak Roman domination number ⋮ On the co-Roman domination in graphs ⋮ Bounds on the co-Roman domination number in graphs

Cites Work

• Irredundance, secure domination and maximum degree in trees
• Roman domination in graphs.
• Defending the Roman Empire---a new strategy
• Vertex Covers and Secure Domination in Graphs
• Dominating Sets in Chordal Graphs
• Parameterized complexity: exponential speed-up for planar graph problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Co-Roman domination in graphs