Graphs with three distinct distance eigenvalues

DOI10.1016/J.AMC.2023.127848MaRDI QIDQ6386154arXivFDO

Authors Yuke Zhang, Huiqiu Lin

Publication date 20 December 2021

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.AMC.2023.127848

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

arXiv classification

math.CO

Abstract: In this paper, some special distance spectral properties of graphs are considered. Concretely, we recursively construct an infinite family of trees with distance eigenvalue $-1$, and determine all $C_3,C_4$-free connected graphs with three distinct distance eigenvalues of which the smallest one is equal to $-3$, which partially answers a problem posed by Koolen, Hayat and Iqbal [Linear Algebra Appl. 505 (2016) 97--108]. Furthermore, we characterize all trees with three distinct distance eigenvalues.

This page was built for publication: Graphs with three distinct distance eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6386154)