4 research outputs found

    On the maximum number of minimum total dominating sets in forests

    Full text link
    We propose the conjecture that every tree with order nn at least 22 and total domination number γt\gamma_t has at most (nγt2γt2)γt2\left(\frac{n-\frac{\gamma_t}{2}}{\frac{\gamma_t}{2}}\right)^{\frac{\gamma_t}{2}} minimum total dominating sets. As a relaxation of this conjecture, we show that every forest FF with order nn, no isolated vertex, and total domination number γt\gamma_t has at most min{(8e)γt(nγt2γt2)γt2,(1+2)nγt,1.4865n}\min\left\{\left(8\sqrt{e}\, \right)^{\gamma_t}\left(\frac{n-\frac{\gamma_t}{2}}{\frac{\gamma_t}{2}}\right)^{\frac{\gamma_t}{2}}, (1+\sqrt{2})^{n-\gamma_t},1.4865^n\right\} minimum total dominating sets
    corecore