We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
On Connected Graphs with Distance Eigenvalue −1 of Multiplicity at Least n−4.
- Authors
Yang, Yuhong
- Abstract
Let G n ([ − 1 ] i) denote the set of all connected graphs on n vertices having distance eigenvalue − 1 of multiplicity i. By using the distribution of the third largest distance eigenvalue and the second least distance eigenvalue of a connected graph, in this paper we completely characterize the graphs in G n ([ − 1 ] i) , where i = n − 1 , n − 2 , n − 3 or n − 4.
- Subjects
GRAPH connectivity; EIGENVALUES; MULTIPLICITY (Mathematics); REGULAR graphs
- Publication
Algebra Colloquium, 2023, Vol 30, Issue 4, p639
- ISSN
1005-3867
- Publication type
Article
- DOI
10.1142/S1005386723000482