Graphs with small diameter determined by their $D$-spectra

DOI10.21136/CMJ.2018.0505-15zbMath1458.05146arXiv1505.07651MaRDI QIDQ4637365

Rui-fang Liu, Jie Xue

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

zbMATH Keywords

distance spectrum\(D\)-spectrum determined by its \(D\)-spectrumdistance characteristic polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (5)

Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph ⋮ On the second largest distance eigenvalue of a block graph ⋮ Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra ⋮ On the \(D_\alpha\)-spectral radius of two types of graphs ⋮ The complements of path and cycle are determined by their distance (signless) Laplacian spectra

This page was built for publication: Graphs with small diameter determined by their $D$-spectra