Journal article
Eigenvalues and expansion of bipartite graphs
In
Designs, Codes and Cryptography
—
2012, Volume 65, Issue 3, pp. 259-273
Abstract
We prove lower bounds on the largest and second largest eigenvalue of the adjacency matrix of bipartite graphs and give necessary and sufficient conditions for equality. We give several examples of classes that are optimal with respect to the bouns. We prove that BIBD-graphs are characterized by their eigenvalues.
Finally we present a new bound on the expansion coefficient of (c,d)-regular bipartite graphs and compare that with aclassical bound.
| Language: | English |
|---|---|
| Publisher: | Springer US |
| Year: | 2012 |
| Pages: | 259-273 |
| Journal subtitle: | An International Journal |
| ISSN: | 15737586 and 09251022 |
| Types: | Journal article |
| DOI: | 10.1007/s10623-011-9598-6 |
