Weighted matrix eigenvalue bounds on the independence number of a graph

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Weighted generalizations of Hoffman's ratio bound on the independence number of a regular graph are surveyed. Several known bounds are reviewed as special cases of modest extensions. Comparisons are made with the Shannon capacity Θ, Lovász' parameter θ{symbol}, Schrijver's parameter θ{symbol}′, and the ultimate independence ratio for categorical products. The survey concludes with some observations on graphs that attain a weighted version of a bound of Cvetković.

Cite

CITATION STYLE

APA

Elzinga, R. J., & Gregory, D. A. (2010). Weighted matrix eigenvalue bounds on the independence number of a graph. Electronic Journal of Linear Algebra, 20, 468–489. https://doi.org/10.13001/1081-3810.1388

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free