Maximum sizes of graphs with given domination parameters (Q1827704)

As their main results the authors prove upper bounds on the sizes of (i) graphs of given order and total domination number, (ii) bipartite graphs of given order and total domination number, (iii) graphs of given order and independent domination number and (iv) bipartite graphs of given order and independent domination number. Whereas in cases (i), (iii) and (iv) the given bounds are sharp for all considered values, the bound in case (ii) is only sharp for all even considered values of the total domination number and a related conjecture is presented. In case (iv) the authors also characterize all extremal graphs. Finally, using known results due to Vizing and Ferneyhough et al. the authors solve the same problems for the lower irredundance number, the independence number, the upper domination number and the upper irredundance number.