Algorithmic aspects of b-disjunctive domination in graphs
From MaRDI portal
Publication:721940
DOI10.1007/S10878-017-0112-6zbMATH Open1402.90198OpenAlexW1542353215MaRDI QIDQ721940FDOQ721940
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some APX-completeness results for cubic graphs
- Incidence matrices and interval graphs
- Disjunctive total domination in graphs
- The disjunctive domination number of a graph
- Title not available (Why is that?)
- Dominating sets for split and bipartite graphs
- On the Kernelization Complexity of Colorful Motifs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- A linear time recognition algorithm for proper interval graphs
- Title not available (Why is that?)
- Domination with exponential decay
- Domination versus disjunctive domination in trees
- B-disjunctive total domination in graphs: algorithm and hardness results
- Algorithmic aspects of disjunctive domination in graphs
- A constructive characterization of trees with equal total domination and disjunctive domination numbers
- Graphs with large disjunctive total domination number
- Bounds on the disjunctive total domination number of a tree
Cited In (14)
- Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
- Algorithmic aspects of paired disjunctive domination in graphs
- Algorithmic aspects of secure connected domination in graphs
- Algorithmic aspects of disjunctive domination in graphs
- B-disjunctive total domination in graphs: algorithm and hardness results
- Algorithmic complexity of weakly connected Roman domination in graphs
- Total 2-rainbow domination in graphs: complexity and algorithms
- Disjunctive domination in graphs with minimum degree at least two
- Total vertex-edge domination in graphs: Complexity and algorithms
- Complexity aspects of variants of independent Roman domination in graphs
- Title not available (Why is that?)
- Algorithmic aspects of total Roman ${2}$-domination in graphs
- Algorithmic aspects of outer independent Roman domination in graphs
- Algorithmic aspects of total Roman \(\{3\}\)-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)
