Graphs with at Most Three Distance Eigenvalues Different from $-1$ - 1 and $-2$ - 2
- 6 March 2018
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 34 (3) , 395-414
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (11671344, 11701492)
This publication has 20 references indexed in Scilit:
- Distance-regular graphs with small number of distinct distance eigenvaluesLinear Algebra and its Applications, 2017
- On regular graphs with four distinct eigenvaluesLinear Algebra and its Applications, 2017
- Hypercubes are determined by their distance spectraLinear Algebra and its Applications, 2016
- Biregular graphs with three eigenvaluesEuropean Journal of Combinatorics, 2016
- The graphs with all but two eigenvalues equal to $-2$ - 2 or 0Designs, Codes and Cryptography, 2016
- The graphs with the least distance eigenvalue at leastLinear Algebra and its Applications, 2016
- On the least distance eigenvalue and its applications on the distance spreadDiscrete Mathematics, 2015
- The graphs with all but two eigenvalues equal to $\pm 1$ ± 1Journal of Algebraic Combinatorics, 2014
- Complete multipartite graphs are determined by their distance spectraLinear Algebra and its Applications, 2014
- Algebraic Graph Theory2001