On the maximum number of minimum total dominating sets in forests

Abstract: We propose the conjecture that every tree with order

n

at least

2

and total domination number

g a m m a_{t}

has at most

l e f t (f r a c n - f r a c g a m m a_{t} 2 f r a c g a m m a_{t} 2 i g h t)^{f r a c g a m m a_{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

g a m m a_{t}

has at most

m i n l e f t l e f t (8 s q r t e, i g h t)^{g a m m a_{t}} l e f t (f r a c n - f r a c g a m m a_{t} 2 f r a c g a m m a_{t} 2 i g h t)^{f r a c g a m m a_{t} 2}, (1 + s q r t 2)^{n - g a m m a_{t}}, 1.486 5^{n} i g h t

minimum total dominating sets.

Recommendations

Cited in

(4)

This page was built for publication: On the maximum number of minimum total dominating sets in forests