characterization of graphs with an eigenvalue of large multiplicity
Clicks: 156
ID: 155208
2020
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
156 views
25 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #11 of 62 articles by views in theater
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
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 family of nonregular graphs with four distinct eigenvalues.
| Reference Key |
qi2020advancescharacterization
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Linming Qi;Lianying Miao;Weiliang Zhao;Lu Liu |
| Journal | theater |
| Year | 2020 |
| DOI |
10.1155/2020/3054672
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.