Graphs with small diameter determined by their $D$-spectra
From MaRDI portal
Publication:4637365
DOI10.21136/CMJ.2018.0505-15zbMath1458.05146arXiv1505.07651MaRDI QIDQ4637365
Publication date: 18 April 2018
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.07651
distance spectrum; \(D\)-spectrum determined by its \(D\)-spectrum; distance characteristic polynomial
05C31: Graph polynomials
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C12: Distance in graphs
Related Items
Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph, Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra, The complements of path and cycle are determined by their distance (signless) Laplacian spectra, On the second largest distance eigenvalue of a block graph, On the \(D_\alpha\)-spectral radius of two types of graphs