On Tournaments with Domination Number Exactly \(k\)

In this paper, we establish that for arbitrary positive integers k and m, where \(k > 1\), there exists a tournament which has exactly m minimum dominating sets of order k. A construction of such tournaments will be given.