Algorithmic aspects of paired disjunctive domination in graphs
From MaRDI portal
Publication:6100186
DOI10.1016/j.tcs.2023.113990OpenAlexW4379933063MaRDI QIDQ6100186
Arti Pandey, Michael A. Henning, Vikash Tripathi
Publication date: 21 June 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113990
approximation algorithmNP-completenessgraph algorithmsinterval graphspaired dominationpaired disjunctive domination
Cites Work
- Unnamed Item
- Unnamed Item
- Disjunctive total domination in graphs
- Algorithmic aspects of \(b\)-disjunctive domination in graphs
- Bounds on the disjunctive total domination number of a tree
- Labelling algorithms for paired-domination problems in block and interval graphs
- \(k\)-tuple domination in graphs
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Some APX-completeness results for cubic graphs
- Total and paired-domination numbers of a tree
- Complexity of paired domination in AT-free and planar graphs
- Domination versus disjunctive domination in trees
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs
- Algorithmic Aspects of Disjunctive Total Domination in Graphs
- The disjunctive domination number of a graph
- Paired Domination in Graphs
- Paired-domination in graphs
- Domination in Graphs: Core Concepts
- Topics in Domination in Graphs
- On disjunctive domination in graphs
- Domination versus disjunctive domination in graphs
- A constructive characterization of trees with equal total domination and disjunctive domination numbers
- Graphs with Large Disjunctive Total Domination Number
This page was built for publication: Algorithmic aspects of paired disjunctive domination in graphs
