Name
Abstract | ||
|---|---|---|
We propose the conjecture that every tree with order n at least 2 and total domination number gamma t has at most (n-gamma t/gamma t/2)(gamma t/2) minimum total dominating sets. As a relaxation of this conjecture, we show that every forest F with order n, no isolated vertex, and total domination number gamma t has at most min {(8 root e)(gamma t) (n-gamma t/2/gamma t/2)(gamma t/2), (1+root 2)(n-gamma t), 1.4865(n)} minimum total dominating sets. |
Year | Venue | Keywords |
|---|---|---|
2019 | DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE | Tree,forest,total domination,domination |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Vertex (geometry),Domination analysis,Conjecture,Mathematics | Journal | 21.0 |
Issue | ISSN | Citations |
3.0 | 1462-7264 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael A. Henning | 1 | 1865 | 246.94 |
| Elena Mohr | 2 | 0 | 0.34 |
| Dieter Rautenbach | 3 | 946 | 138.87 |