 |
Free and accessible knowledge |
Journal articles
A new lower bound on the independence number of graphs
Abstract : We propose a new lower bound on the independence number of a graph. We show that our bound compares favorably to recent ones (e.g. [12]). We obtain our bound by using the Bhatia-Davis inequality applied with analytical results (minimum, maximum, expectation and variance) of an algorithm for the vertex cover problem.
Cited literature [17 references]
https://hal.archives-ouvertes.fr/hal-00785106
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Monday, April 14, 2014 - 4:58:12 PM
Last modification on : Tuesday, January 25, 2022 - 8:30:02 AM
Long-term archiving on: : Monday, July 14, 2014 - 10:36:27 AM
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Monday, April 14, 2014 - 4:58:12 PM
Last modification on : Tuesday, January 25, 2022 - 8:30:02 AM
Long-term archiving on: : Monday, July 14, 2014 - 10:36:27 AM
File
publi1818.pdf
Files produced by the author(s)