Back to Search
Start Over
Graphs with Unique Minimum Specified Domination Sets.
- Source :
-
Graphs & Combinatorics . Oct2023, Vol. 39 Issue 5, p1-13. 13p. - Publication Year :
- 2023
-
Abstract
- In this paper, we consider the graphs that have a unique set that achieves a domination parameter and determine the maximum value of the associated parameter, both in graphs in general and in graphs without end-vertices. For example, for a graph G of order n without an end-vertex, we show an upper bound of n/3 if G has a unique minimum dominating set, an upper bound of (n - 1) / 2 if G has a unique minimum total dominating set or a unique minimum 2-dominating set, and an upper bound of n/2 if G has a unique paired dominating set. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 39
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 170035964
- Full Text :
- https://doi.org/10.1007/s00373-023-02704-1