Disjoint dominating and 2-dominating sets in graphs
From MaRDI portal
Publication:2299982
DOI10.1016/j.disopt.2019.100553zbMath1506.05161arXiv1903.06129OpenAlexW2969695232MaRDI QIDQ2299982
Mateusz Miotk, Paweł Żyliński, Jerzy Topp
Publication date: 24 February 2020
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.06129
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Graphs with disjoint 2-dominating sets ⋮ Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Spanning trees with disjoint dominating and 2-dominating sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Disjoint dominating and total dominating sets in graphs
- Dominating and total dominating partitions in cubic graphs
- A characterization of graphs with disjoint dominating and paired-dominating sets
- Remarks about disjoint dominating sets
- An independent dominating set in the complement of a minimum dominating set of a tree
- Inverse domination in graphs
- Pairs of disjoint dominating sets and the minimum degree of graphs
- Partitioning the vertices of a cubic graph into two total dominating sets
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
- Trees with two disjoint minimum independent dominating sets
- On graphs with disjoint dominating and 2-dominating sets
- Partitioning a graph into a dominating set, a total dominating set, and something else
- A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
- Planar 3DM is NP-complete
- On the Computational Complexity of Combinatorial Problems
- Total Domination in Graphs
- Graphs with equal domination and certified domination numbers
- Partitioning the Vertices of a Graph into Two Total Dominating Sets
- Paths, Trees, and Flowers
- Parallel Processing and Applied Mathematics
This page was built for publication: Disjoint dominating and 2-dominating sets in graphs
