๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on eigenvalue bounds for independence numbers of non-regular graphs

โœ Scribed by Li, Yusheng; Zhang, Zhen

Book ID
122233988
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
297 KB
Volume
174
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A lower bound on the independence number
A lower bound on the independence number of a graph
โœ Jochen Harant ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 210 KB

A new lower bound on the independence number of a graph is established and an accompanying efficient algorithm constructing an independent vertex set the cardinality of which is at least this lower bound is given. (~

A Probabilistic lower bound on the indep
A Probabilistic lower bound on the independence number of graphs
โœ Stanley M. Selkow ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 124 KB

Caro (1979) and Wei (1981) established a bound on the size of an independent set of a graph as a function of its degrees. In case the degrees of each vertex's neighbors are also known, we establish a lower bound which is tighter for most graphs.