Spectral distances of graphs based on their different matrix representations

DOI10.2298/FIL1404723JMaRDI QIDQ2975512zbMATH OpenOpenAlexFDO

Authors Irena M. Jovanović, Zoran Stanić

Publication date 11 April 2017

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/fil1404723j

zbMATH Keywords

complete multipartite graphscospectrality measuregraph matricesspectral diameterspectral distance

Mathematics Subject Classification ID

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

Recommendations

• Spectral distances in some sets of graphs
• Laplacian and normalized Laplacian spectral distances of graphs
• The distance Laplacian and distance signless Laplacian spectrum of some graphs.
• Some results on spectral distances of graphs
• Cospectrality of graphs with respect to distance matrices

Cited in

(8)

• Laplacian and normalized Laplacian spectral distances of graphs
• Spectral distances on graphs
• On description of biological sequences by spectral properties of line distance matrices
• Proof of a conjecture on spectral distance between cycles, paths and certain trees
• Spectral Slater index of tournaments
• Cospectrality of multipartite graphs
• Spectral distances in some sets of graphs
• Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph

This page was built for publication: Spectral distances of graphs based on their different matrix representations

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