Maximum number of minimum dominating and minimum total dominating sets
Given a connected graph of order \(n\) and domination or total domination number \(\gamma\), the paper considers the problem of determining the maximum number of minimum (total) dominating sets. The problem is solved for \(\gamma = 2\) for the domination number and for the total domination number. For larger \(\gamma\), a construction is given that yields a non-trivial lower bound for the domination number.
scientific article; zbMATH DE number 6335657