New bounds on domination and independence in graphs
Combinatorics
2022-01-25 v2
Abstract
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.
Cite
@article{arxiv.2008.12601,
title = {New bounds on domination and independence in graphs},
author = {Jochen Harant and Samuel Mohr},
journal= {arXiv preprint arXiv:2008.12601},
year = {2022}
}