Graphs whose normalized Laplacian has three eigenvalues
classification
🧮 math.CO
keywords
graphseigenvaluesexampleslaplaciannormalizedthreewhosebipartite
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.