Optimal Embeddings of Distance Regular Graphs into Euclidean Spaces

Simple item page
dc.creatorVallentin, Frank
dc.date2005-09-30
dc.date2007-05-24
dc.date.accessioned2026-07-07T08:42:44Z
dc.date.available2026-07-07T08:42:44Z
dc.descriptionIn this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular graphs. Our technique involves semidefinite programming and exploiting the algebra structure of the optimization problem so that the question of finding a lower bound of the least distortion is reduced to an analytic question about orthogonal polynomials.
dc.description10 pages, (v3) some corrections, accepted in Journal of Combinatorial Theory, Series B
dc.identifierhttps://arxiv.org/abs/math/0509716
dc.identifierhttp://arxiv.org/abs/math/0509716
dc.identifierJ. Combin. Theory Ser. B 98 (2008), 95-104
dc.identifierdoi:10.1016/j.jctb.2007.06.002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142066
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject90C22, 05E30
dc.titleOptimal Embeddings of Distance Regular Graphs into Euclidean Spaces
dc.typetext

Files

Collections

arXiv