Publication:4685884
From MaRDI portal
zbMath1396.05068MaRDI QIDQ4685884
Publication date: 9 October 2018
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypercubes are determined by their distance spectra
- Spectral characterizations of almost complete graphs
- Distance spectral radius of digraphs with given connectivity
- The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
- Developments on spectral characterizations of graphs
- Eigenvalue interlacing for certain classes of matrices with real principal minors
- Commutativity and spectra of Hermitian matrices
- Which graphs are determined by their spectrum?
- The complement of the path is determined by its spectrum
- On graphs with at least three distance eigenvalues less than \(-1\)
- The graphs with all but two eigenvalues equal to \(\pm 1\)
- A construction of distance cospectral graphs
- Complete multipartite graphs are determined by their distance spectra
- On the distance spectrum of graphs
- On the Polynomial of a Graph