Graphs whose normalized Laplacian has three eigenvalues

Details Graphs whose normalized Laplacian has three eigenvalues Graphs whose normalized Laplacian has three eigenvalues

2012-02-14

arxiv.org/abs/1202.3027v1

Linear Algebra and its Applications 435 (2011), 2560-2569

Mathematics

Combinatorics

Scientific paper

10.1016/j.laa.2011.02.005

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.

Affiliated with

Also associated with

No associations

Rating

Graphs whose normalized Laplacian has three eigenvalues does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphs whose normalized Laplacian has three eigenvalues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphs whose normalized Laplacian has three eigenvalues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-89284