Characterization of Graphs with an Eigenvalue of Large Multiplicity
Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the eigenvalues of G. In this paper, we characterize all the n-vertex graphs with some eigenvalue of multiplicity n−2 and n−3, respectively. Moreover, as an application of the main result, we present a fa...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2020-01-01
|
Series: | Advances in Mathematical Physics |
Online Access: | http://dx.doi.org/10.1155/2020/3054672 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|