Alon–Boppana bound
id:
alon-boppana-bound-238-14010513
title:
Alon–Boppana bound
text:
In spectral graph theory, the Alon–Boppana bound provides a lower bound on the second-largest eigenvalue of the adjacency matrix of a d -regular graph, meaning a graph in which every vertex has degree d . The reason for the interest in the second-largest eigenvalue is that the largest eigenvalue is guaranteed to be d due to d -regularity, with the all-ones vector being the associated eigenvector. The graphs that come close to meeting this bound are Ramanujan graphs, which are examples of the bes
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Alon%E2%80%93Boppana_bound
date created:
date modified:
2024-02-07T16:59:49Z
main entity:
{"identifier":"Q85741005","url":"https://www.wikidata.org/entity/Q85741005"}
image:
fields total:
13
integrity:
13