Vertices contained in all or in no minimum paired-dominating set of a tree
From MaRDI portal
Publication:995930
DOI10.1007/S10878-005-4107-3zbMATH Open1122.05071OpenAlexW2059672600MaRDI QIDQ995930FDOQ995930
Authors: Michael A. Henning, Michael D. Plummer 
Publication date: 10 September 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-4107-3
Recommendations
- Vertices contained in all or in no minimum total dominating set of a tree
- Vertices contained in all or in no minimum disjunctive dominating set of a tree
- Vertices contained in all or in no minimum \(k\)-dominating sets of a tree
- Vertices contained in all or in no minimum semitotal dominating set of a tree
- Vertices contained in every minimum dominating set of a tree
- Vertices contained in all minimum paired-dominating sets of a tree
- Vertices belonging to all or to no minimum vertex-edge dominating sets in trees
- Vertices belonging to all or to no minimum locating dominating sets of trees
- scientific article; zbMATH DE number 6470870
- Vertices belonging to all or to no minimum double dominating sets in trees
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination in claw-free cubic graphs
- Paired-domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination of trees
- Vertices contained in every minimum dominating set of a tree
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
- Paired-domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertices contained in all or in no minimum total dominating set of a tree
Cited In (25)
- Vertices belonging to all or to no minimum double dominating sets in trees
- Graphs with maximum size and given paired-domination number
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Which trees have a differentiating-paired dominating set?
- Title not available (Why is that?)
- Vertices contained in every minimum dominating set of a tree
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- Paired-domination of trees
- Lower bound on the paired domination number of a tree
- Edges contained in all or in no minimum edge dominating set of a tree
- Graphs with unique minimum paired-dominating set.
- Upper paired-domination in claw-free graphs
- Vertices contained in all or in no minimum semitotal dominating set of a tree
- Paired-domination in generalized claw-free graphs
- Graphs with disjoint dominating and paired-dominating sets
- Locating and paired-dominating sets in graphs
- Paired-domination in claw-free graphs with minimum degree at least three
- Vertices in all minimum paired-dominating sets of block graphs
- Paired domination in graphs
- Paired-domination subdivision numbers of graphs
- Graphs with large paired-domination number
- A characterization of graphs with disjoint dominating and paired-dominating sets
- Vertices contained in all minimum paired-dominating sets of a tree
- Paired-domination in claw-free graphs
- The diameter of paired-domination vertex critical graphs
This page was built for publication: Vertices contained in all or in no minimum paired-dominating set of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995930)
