New bounds on domination and independence in graphs
@article{Harant2020NewBO,
title={New bounds on domination and independence in graphs},
author={J. Harant and S. Mohr},
journal={arXiv: Combinatorics},
year={2020}
}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.
References
SHOWING 1-10 OF 18 REFERENCES
A new lower bound on the independence number of graphs
- Computer Science, Mathematics
- Discret. Appl. Math.
- 2013
- 14
- Highly Influential
- PDF
A Probabilistic lower bound on the independence number of graphs
- Computer Science, Mathematics
- Discret. Math.
- 1994
- 31
On Selkow’s Bound on the Independence Number of Graphs
- Mathematics, Computer Science
- Discuss. Math. Graph Theory
- 2019
- 4
- PDF