Algorithmic aspects of k-part degree restricted domination in graphs

DOI10.1142/S1793830920500573zbMath1457.05078OpenAlexW3041086172MaRDI QIDQ5858166

Manazhy Rashmi, S. S. Kamath, A. Senthil Thilak

Publication date: 9 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500573

zbMATH Keywords

dominating setvertex cover\textsf{NP}-completeness\(k\)-part degree restricted dominating set

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

k-Efficient domination: Algorithmic perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Dominating sets for split and bipartite graphs
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• The complexity of domination problems in circle graphs
• Cutting down recursive trees
• Relation Between k-DRD and Dominating Set
• Dominating Sets in Chordal Graphs
• Graph Classes: A Survey

This page was built for publication: Algorithmic aspects of k-part degree restricted domination in graphs