Graphs with three distinct distance eigenvalues
From MaRDI portal
Publication:2698139
DOI10.1016/j.amc.2023.127848OpenAlexW4317931770MaRDI QIDQ2698139
Publication date: 21 April 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.10375
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypercubes are determined by their distance spectra
- On the distribution of Laplacian eigenvalues of trees
- The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- Factoring distance matrix polynomials
- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
- On the distance spectra of threshold graphs
- Addressing the Petersen graph
- Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra
- Distance eigenvalues of a cograph and their multiplicities
- Distance spectra of graphs: a survey
- On the least distance eigenvalue and its applications on the distance spread
- On Moore Graphs with Diameters 2 and 3
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- The distance spectrum of a tree
- Thekth Laplacian eigenvalue of a tree
- The multiplicity of -2 as an eigenvalue of the distance matrix of graphs
- On the Addressing Problem for Loop Switching
This page was built for publication: Graphs with three distinct distance eigenvalues
