Algorithmic results for weak Roman domination problem in graphs

DOI10.1016/J.DAM.2024.08.007MaRDI QIDQ6633543

Ankit Sharma, Kaustav K. Paul, Arti Pandey

Publication date: 6 November 2024

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

zbMATH Keywords

NP-completenessbipartite graphsgraph algorithmssplit graphs\(P_4\)-sparse graphsweak Roman dominating function

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Clustering to minimize the maximum intercluster distance
• Roman domination in graphs.
• Some APX-completeness results for cubic graphs
• Domination in some subclasses of bipartite graphs
• Defending the Roman Empire---a new strategy
• On some domination colorings of graphs
• Exact algorithms for weak Roman domination
• A characterization of Roman trees

This page was built for publication: Algorithmic results for weak Roman domination problem in graphs

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