Hypercubes are determined by their distance spectra

DOI10.1016/J.LAA.2016.04.036MaRDI QIDQ290656zbMATH OpenOpenAlexFDO

Authors Sakander Hayat, Quaid Iqbal, Jack H. Koolen

Publication date 3 June 2016

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.04160

zbMATH Keywords

cospectral graphsdistance matrixdistance spectrumhypercubesisometric embedding

Mathematics Subject Classification ID

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

Abstract: We show that the d-cube is determined by the spectrum of its distance matrix.

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3547309 (Why is no real title available?)
• scientific article; zbMATH DE number 3627232 (Why is no real title available?)
• Biregular graphs with three eigenvalues
• Characterizing distance-regularity of graphs by the spectrum
• Collapse of the metric hierarchy for bipartite graphs
• Complete multipartite graphs are determined by their distance spectra
• Developments on spectral characterizations of graphs
• Distance spectra of graphs: a survey
• Distance-regular graphs the distance matrix of which has only one positive eigenvalue
• Geometry of cuts and metrics
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• Multiplicative cones - a family of three eigenvalue graphs
• Nonregular graphs with three eigenvalues
• On Isometric Embeddings of Graphs
• On graphs with three eigenvalues
• On the Polynomial of a Graph
• On the distance spectra of graphs
• On the distance spectrum of graphs
• Spectra of graphs
• Spectral characterization of the Hamming graphs
• Which graphs are determined by their spectrum?

Cited in

(13)

• On graphs with three distinct signless Laplacian eigenvalues
• The complements of path and cycle are determined by their distance (signless) Laplacian spectra
• Graphs with three distinct distance eigenvalues
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• Some graphs determined by their distance spectrum
• On the multiplicity of the least signless Laplacian eigenvalue of a graph
• Distance spectrum of the Hadamard product of a cubic graph
• Corrigendum to: ``Hypercubes are determined by their distance spectra
• Distance-regular graphs with a few \(q\)-distance eigenvalues
• Spectra of variants of distance matrices of graphs and digraphs: a survey
• On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
• Spectral determinations and eccentricity matrix of graphs
• Distance eigenvalues of \(B(n, k)\)

This page was built for publication: Hypercubes are determined by their distance spectra

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