Unique minimum semipaired dominating sets in trees
From MaRDI portal
Publication:2107740
DOI10.7151/DMGT.2349zbMATH Open1504.05216OpenAlexW3081655177MaRDI QIDQ2107740FDOQ2107740
Michael A. Henning, Teresa W. Haynes
Publication date: 2 December 2022
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2349
Recommendations
Cites Work
- Total Domination in Graphs
- Graphs with large semipaired domination number
- Characterizations of trees with equal domination parameters
- Paired-domination in graphs
- Trees with unique minimum total dominating sets
- Title not available (Why is that?)
- Vertices contained in every minimum dominating set of a tree
- Semipaired domination in claw-free cubic graphs
- Paired domination in graphs: a survey and recent results
- Title not available (Why is that?)
- On unique independent sets in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect graphs involving semitotal and semipaired domination
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Block graphs with unique minimum dominating sets
- On unique minimum dominating sets in some Cartesian product graphs
- Complexity and algorithms for semipaired domination in graphs
- Graphs with unique minimum paired-dominating set.
- Title not available (Why is that?)
- Semipaired domination in maximal outerplanar graphs
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Unique minimum semipaired dominating sets in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107740)
