✦ LIBER ✦

Spectral bounds for the clique and independence numbers of graphs

✍ Scribed by Herbert S Wilf

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 277 KB
Volume: 40
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(86)90069-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On clique covers and independence number

On clique covers and independence numbers of graphs

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 485 KB

An upper bound on the number of cliques

An upper bound on the number of cliques in a graph

✍ Martin Farber; Mihály Hujter; Zsolt Tuza 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 1 views

Upper bounds on the edge clique cover nu

Upper bounds on the edge clique cover number of a graph

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 521 KB

A lower bound for the independence numbe

A lower bound for the independence number of a planar graph

✍ Michael O Albertson 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 403 KB

The Laplacian spectral radius for unicyc

The Laplacian spectral radius for unicyclic graphs with given independence number

✍ Lihua Feng; Guihai Yu; Aleksandar Ilić 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 390 KB

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.