Graph Eigenvalues and Projection Constants

Tanay Wakhare

Let ${\lambda }_1(G)\ge {\lambda }_2(G)\ge \cdots \ge {\lambda }_n(G)$ denote the adjacency eigenvalues of a graph $G$ of order $n$. We prove that for every $k\ge 2$ and every graph $G$ on $n\ge k$ vertice…