Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 402, Issue -, Pages -Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2021.126137
Keywords
Third largest eigenvalue; Distance matrix; Distance spectra; Chain graph
Categories
Funding
- NSFC [12001498, 11971445]
- NSF of Henan [202300410377]
- China Postdoctoral Science Foundation [2020M682325]
Ask authors/readers for more resources
This paper discusses the distance eigenvalues of chain graphs and characterizes all connected graphs with a third largest distance eigenvalue of at most -1 using clique extension. It also proves that a graph is determined by its distance spectrum if its third largest distance eigenvalue is less than -1.
In this paper, the distance eigenvalues of chain graphs are discussed. Using clique extension, we characterize all connected graphs whose third largest distance eigenvalue is at most -1. As an application, it is proved that a graph is determined by its distance spectrum if its third largest distance eigenvalue is less than -1. (C) 2021 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
