Corpus ID: 221370692

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. 

Tables from this paper

References

SHOWING 1-10 OF 18 REFERENCES
A new lower bound on the independence number of graphs
  • 14
  • Highly Influential
  • PDF
Upper Bounds for the Domination Number of a Graph
  • 18
  • Highly Influential
Domination in bipartite graphs
  • 10
  • PDF
A Probabilistic lower bound on the independence number of graphs
  • S. Selkow
  • Computer Science, Mathematics
  • Discret. Math.
  • 1994
  • 31
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
  • 161
A Better Bound on the Variance
  • 140
On Selkow’s Bound on the Independence Number of Graphs
  • 4
  • PDF
Independence in connected graphs
  • 22
  • PDF
...
1
2
...