The least Euclidean distortion constant of a distance-regular graph

DOI10.1016/j.dam.2022.10.014zbMath1504.05077arXiv2109.09708OpenAlexW3200406367MaRDI QIDQ2104939

Hirotake Kurihara, Ferdinand Ihringer, Himanshu Gupta, Sebastian M. Cioabă

Publication date: 8 December 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

distance-regular graphseigenvalues of graphsodd graphsEuclidean embeddingGrassmann graphsgraphs with classical parametersHermitian forms graphsleast distortion

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Least distortion Euclidean embeddings of flat tori

Cites Work

• Unnamed Item
• Unnamed Item
• The Euclidean distortion of generalized polygons
• On Lipschitz embedding of finite metric spaces in Hilbert space
• A partially ordered set and q-Krawtchouk polynomials
• Hermitian rank distance codes
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
• Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders
• The geometry of graphs and some of its algorithmic applications
• Optimal distortion embeddings of distance regular graphs into Euclidean spaces
• On the nonexistence of uniform homeomorphisms between \(L^ p\)-spaces
• L ^p -distortion and p -spectral gap of finite graphs