Hardness results of global Roman domination in graphs

DOI10.1016/J.DAM.2023.08.020zbMath1526.05110OpenAlexW4386514390MaRDI QIDQ6069177

B. S. Panda, Pooja Goyal

Publication date: 13 November 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.08.020

zbMATH Keywords

NP-completenessdominationAPX-completeness

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman domination on strongly chordal graphs
• Hardness results of global Roman domination in graphs
• Global Roman domination in graphs
• Roman domination in graphs.
• Some APX-completeness results for cubic graphs
• Threshold graphs and related topics
• Global Roman domination in trees
• Incidence matrices and interval graphs

This page was built for publication: Hardness results of global Roman domination in graphs