The distance spectrum of the complements of graphs of diameter greater than three
Authors:
- 22 August 2022
- journal article
- research article
- Published by Springer Nature in Indian Journal of Pure and Applied Mathematics
- Vol. 54 (4) , 959-965
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11461071)
This publication has 13 references indexed in Scilit:
- The least signless Laplacian eignvalue of the complements of unicyclic graphsApplied Mathematics and Computation, 2017
- On the least distance eigenvalue and its applications on the distance spreadDiscrete Mathematics, 2015
- Distance spectra of graphs: A surveyLinear Algebra and its Applications, 2014
- On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphsLinear Algebra and its Applications, 2014
- On the least distance eigenvalue of a graphLinear Algebra and its Applications, 2013
- Distance spectral radius of trees with fixed number of pendent verticesLinear Algebra and its Applications, 2013
- On the maximal distance spectral radius of graphs without a pendent vertexLinear Algebra and its Applications, 2013
- The least eigenvalue of the signless Laplacian of the complements of treesLinear Algebra and its Applications, 2012
- The least eigenvalue of the complements of treesLinear Algebra and its Applications, 2011
- Distance spectral radius of trees with given matching numberDiscrete Applied Mathematics, 2010