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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00785106
Contributor : Frédéric Davesne <>
Submitted on : Monday, April 14, 2014 - 4:58:12 PM
Last modification on : Thursday, February 13, 2020 - 2:02:12 PM
Long-term archiving on: Monday, July 14, 2014 - 10:36:27 AM

File

publi1818.pdf
Files produced by the author(s)

Identifiers

Citation

Eric Angel, Romain Campigotto, Christian Laforest. A new lower bound on the independence number of graphs. Discrete Applied Mathematics, Elsevier, 2013, 161 (6), pp.847--852. ⟨10.1016/j.dam.2012.10.00⟩. ⟨hal-00785106⟩

Share

Metrics

Record views

381

Files downloads

564