Spectra of Graphs and the Spectral Criterion for Property (T)
2017  //  DOI: 10.5614/ejgta.2017.5.1.11
Alain Valette

Metrics

  • Eye Icon 248 views
  • Download Icon 48 downloads
Metrics Icon 248 views  //  48 downloads
Spectra of Graphs and the Spectral Criterion for Property (T) Image
Abstract

For a finite connected graph $X$, we consider the graph $RX$ obtained from $X$ by associating a new vertex to every edge of $X$ and joining by edges the extremities of each edge of $X$ to the corresponding new vertex. We express the spectrum of the Laplace operator on $RX$ as a function of the corresponding spectrum on $X$. As a corollary, we show that $X$ is a complete graph if and only if $\lambda_1(RX)>\frac{1}{2}$. We give a re-interpretation of the correspondence $X\mapsto RX$ in terms of the right-angled Coxeter group defined by $X$.

Full text
Show more arrow
 

Metrics

  • Eye Icon 248 views
  • Download Icon 48 downloads
Metrics Icon 248 views  //  48 downloads