A new lower bound on the independence number of graphs - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2013

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.
Fichier principal
Vignette du fichier
publi1818.pdf (143.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00785106 , version 1 (14-04-2014)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More