Hypercubes are determined by their distance spectra
From MaRDI portal
Publication:290656
DOI10.1016/J.LAA.2016.04.036zbMATH Open1338.05067arXiv1512.04160OpenAlexW2963413075MaRDI QIDQ290656FDOQ290656
Sakander Hayat, Quaid Iqbal, Jack H. Koolen
Publication date: 3 June 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Abstract: We show that the d-cube is determined by the spectrum of its distance matrix.
Full work available at URL: https://arxiv.org/abs/1512.04160
Cites Work
- Spectra of graphs
- Developments on spectral characterizations of graphs
- Distance-regular graphs the distance matrix of which has only one positive eigenvalue
- Which graphs are determined by their spectrum?
- Distance spectra of graphs: a survey
- On the distance spectra of graphs
- Title not available (Why is that?)
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- Geometry of cuts and metrics
- Multiplicative cones - a family of three eigenvalue graphs
- Nonregular graphs with three eigenvalues
- On graphs with three eigenvalues
- Biregular graphs with three eigenvalues
- On Isometric Embeddings of Graphs
- Spectral characterization of the Hamming graphs
- Collapse of the metric hierarchy for bipartite graphs
- Complete multipartite graphs are determined by their distance spectra
- On the distance spectrum of graphs
- On the Polynomial of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- Characterizing distance-regularity of graphs by the spectrum
Cited In (12)
- 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\)
- On the multiplicity of the least signless Laplacian eigenvalue of a graph
- Corrigendum to: ``Hypercubes are determined by their distance spectra
- Distance eigenvalues of B(n, k)
- 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
- Title not available (Why is that?)
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)
