A new lower bound on the independence number of graphs

Eric Angel; Romain Campigotto; Christian Laforest

doi:10.1016/j.dam.2012.10.00

Journal articles

A new lower bound on the independence number of graphs

Eric Angel ¹ Romain Campigotto ² Christian Laforest ³

1 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes

2 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

3 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes

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.

Keywords : Expectation Graphs Independence number Variance Vertex cover

Document type :

Journal articles

Domain :

Computer Science [cs] / Modeling and Simulation

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 : Wednesday, February 24, 2021 - 4:26:02 PM
Long-term archiving on: : Monday, July 14, 2014 - 10:36:27 AM

A new lower bound on the independence number of graphs

File

Identifiers

Collections

Citation

Export

Metrics

411

800

A new lower bound on the independence number of graphs

File

Identifiers

Collections

Citation

Export

Share

Metrics

411

800