Graphs with three eigenvalues
In this final year project, we have studied the graphs whose adjacency matrices have three distinct eigenvalues. There are mainly two topics studied in the project. First, in section 2, we focus on two interesting nonregular graphs with three distinct eigenvalues and three valencies. A technique, G...
Saved in:
Main Author: | Xiong, Zhiyuan |
---|---|
Other Authors: | Gary Royden Watson Greaves |
Format: | Final Year Project |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/77158 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Eigenvalues of the perfect matching derangement graph
by: Koh, Samuel Zhi Kang
Published: (2023) -
Chromatic polynomials of signed graphs
by: Utomo, Charissa Irene
Published: (2023) -
Toxicity prediction via algebraic graph-assisted bidirectional transformers
by: Ooi, Yen Sun
Published: (2023) -
On distance-regular graphs and (s,c,a,k)-graphs
by: Bautista, Lincoln A.
Published: (1998) -
Graphs with three eigenvalues and second largest eigenvalue at most 1
by: Cheng, Xi-Ming, et al.
Published: (2020)