Paired Domination in Graphs
From MaRDI portal
Publication:3384606
DOI10.1007/978-3-030-51117-3_3zbMath1479.05259MaRDI QIDQ3384606
Teresa W. Haynes, Michael A. Henning, Wyatt J. Desormeaux
Publication date: 15 December 2021
Published in: Topics in Domination in Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51117-3_3
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Upper paired domination versus upper domination, Paired domination stability in graphs, Grouped domination parameterized by vertex cover, twin cover, and beyond, Graphs with unique minimum specified domination sets, Algorithmic aspects of paired disjunctive domination in graphs, Paired-domination game played on cycles, Grouped domination parameterized by vertex cover, twin cover, and beyond, Complexity of the paired domination subdivision problem, Bounds on the paired domination number of graphs with minimum degree at least three, Paired domination in trees, Cubic graphs have paired-domination number at most four-seventh of their orders
Cites Work
- A note on total and paired domination of Cartesian product graphs
- Perfect matchings in paired domination vertex critical graphs
- Paired-domination in inflated graphs
- Paired-domination in subdivided star-free graphs
- Paired-domination in claw-free cubic graphs
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- Upper paired-domination in claw-free graphs
- Graphs with large paired-domination number
- Dominating direct products of graphs
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
- Bounds on total domination in claw-free cubic graphs
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Labelling algorithms for paired-domination problems in block and interval graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Paired-domination number of a graph and its complement
- Upper bounds on the paired-domination number
- Paired-domination in \(P_{5}\)-free graphs
- Paired domination vertex critical graphs
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs
- Total domination in planar graphs of diameter two
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- An inequality related to Vizing's conjecture
- Computing a minimum paired-dominating set in strongly orderable graphs
- Total domination versus paired-domination in regular graphs
- Paired-domination in claw-free graphs with minimum degree at least three
- Total and paired-domination numbers of a tree
- Paired-domination of trees
- An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs
- Paired versus double domination in \(K_{1,r}\)-free graphs
- Algorithmic aspects of upper paired-domination in graphs
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- A linear-time algorithm for paired-domination on circular-arc graphs
- Paired domination on interval and circular-arc graphs
- A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
- Graphs with maximum size and given paired-domination number
- Paired-domination in generalized claw-free graphs
- Characterizations of trees with equal paired and double domination numbers
- Upper bounds for the paired-domination numbers of graphs
- Paired-domination in claw-free graphs
- All graphs with paired-domination number two less than their order
- Bounding the paired-domination number of a tree in terms of its annihilation number
- A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
- Vizing's conjecture: a survey and recent results
- Paired domination in prisms of graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- The paired-domination and the upper paired-domination numbers of graphs
- The diameter of paired-domination vertex critical graphs
- Vertex domination-critical graphs
- Domination in planar graphs with small diameter*
- Paired-domination in graphs
- Total domination versus paired domination
- Paired- and induced paired-domination in (E,net)-free graphs
- Domination numbers of planar graphs
- Paired-Domination Game Played in Graphs
- Upper total domination versus upper paired-domination
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
