Algorithmic aspects of b-disjunctive domination in graphs

DOI10.1007/S10878-017-0112-6MaRDI QIDQ721940zbMATHOpenAlexFDO

Authors B. S. Panda, Arti Pandey, S. Paul

Publication date 20 July 2018

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-017-0112-6

zbMATH Keywords

approximation algorithmgraph algorithmdominationNP-completechordal graphAPX-complete

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Algorithmic aspects of disjunctive domination in graphs
• B-disjunctive total domination in graphs: algorithm and hardness results
• Domination versus disjunctive domination in graphs
• Algorithmic aspects of disjunctive total domination in graphs
• The disjunctive domination number of a graph

Cites work

• scientific article; zbMATH DE number 4152428 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A constructive characterization of trees with equal total domination and disjunctive domination numbers
• A linear time recognition algorithm for proper interval graphs
• Algorithmic aspects of disjunctive domination in graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• B-disjunctive total domination in graphs: algorithm and hardness results
• Bounds on the disjunctive total domination number of a tree
• Disjunctive total domination in graphs
• Dominating sets for split and bipartite graphs
• Domination versus disjunctive domination in trees
• Domination with exponential decay
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• Graphs with large disjunctive total domination number
• Incidence matrices and interval graphs
• On the Kernelization Complexity of Colorful Motifs
• Some APX-completeness results for cubic graphs
• The disjunctive domination number of a graph

Cited in

(14)

• Complexity aspects of variants of independent Roman domination in graphs
• B-disjunctive total domination in graphs: algorithm and hardness results
• scientific article; zbMATH DE number 7693181 (Why is no real title available?)
• Algorithmic aspects of secure connected domination in graphs
• Algorithmic complexity of weakly connected Roman domination in graphs
• Algorithmic aspects of total Roman ${2}$-domination in graphs
• Algorithmic aspects of outer independent Roman domination in graphs
• Algorithmic aspects of paired disjunctive domination in graphs
• Disjunctive domination in graphs with minimum degree at least two
• Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
• Total vertex-edge domination in graphs: Complexity and algorithms
• Total 2-rainbow domination in graphs: complexity and algorithms
• Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
• Algorithmic aspects of disjunctive domination in graphs

This page was built for publication: Algorithmic aspects of \(b\)-disjunctive domination in graphs

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