Graphs whose normalized Laplacian has three eigenvalues

E.R Van Dam,G.R Omidi

doi:10.1016/j.laa.2011.02.005

Graphs whose normalized Laplacian has three eigenvalues

E.R Van Dam, G.R Omidi

Open Access

https://doi.org/10.1016/j.laa.2011.02.005

Copy DOI

Journal: Linear Algebra and Its Applications	Publication Date: Apr 14, 2011
Citations: 35	License type: elsevier-specific

Affiliation: Tilburg University, Institute for Research in Fundamental Sciences, University of Technology

#Conference Graphs #Quasi-symmetric Designs + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eigenvalues. Strongly regular graphs and complete bipartite graphs are examples of such graphs, but we also construct more exotic families of examples from conference graphs, projective planes, and certain quasi-symmetric designs.

Full Text