b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results

DOI10.1007/978-3-319-29221-2_24zbMath1437.68139OpenAlexW2407697747MaRDI QIDQ2795954

Arti Pandey, B. S. Panda

Publication date: 23 March 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_24

zbMATH Keywords

graph algorithmapproximation algorithmchordal graphNP-completedominationAPX-complete

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (1)

Algorithmic aspects of \(b\)-disjunctive domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjunctive total domination in graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• A survey of selected recent results on total domination in graphs
• Some APX-completeness results for cubic graphs
• Domination versus disjunctive domination in trees
• The disjunctive domination number of a graph
• Algorithmic Aspects of Disjunctive Domination in Graphs
• Total Domination in Graphs
• Graphs with Large Disjunctive Total Domination Number

This page was built for publication: b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results