Jochen Harant, Samuel Mohr
Published 2020-08-28Version 1
We propose new bounds on the domination number and on the independence number of a graph and show that our bounds compare favorably to recent ones. Our bounds are obtained by using the Bhatia-Davis inequality linking the variance, the expected value, the minimum, and the maximum of a random variable with bounded distribution.
Improved upper bounds on the domination number of graphs with minimum degree at least five
On Domination Number and Distance in Graphs
On the equality of domination number and $ 2 $-domination number
![QR code for arXiv:2008.12601 [math.CO]](http://oss.arxitics.com/images/favicon.svg)