An improved upper bound for the domination number of a graph

Subramanian Arumugam, Suresh Manjanath Hegde, Shashanka Kulamarva

Let $G$ be a graph of order $n$. A classical upper bound for the domination number of a graph $G$ having no isolated vertices is $\lfloor \frac{n}{2}\rfloor$. However, for several f…