Makoto Tagami, Kyushu Institute of Technology
Large Conference Room, Math Building
The Euclidean distortion of a graph is the ratio representing the correctness of embeding the graph to Euclidean space in preserving the graph distance as possible. Up to the present, the minimal Euclidean distortion has been determined only for some infinite families of graphs with high symmetry, for example, for cycle graphs, strongly regular graphs and so on. In this talk, we determine the minimal Euclidean distortion for general connected graphs having up to five vertices. This is joint work with Mika Hayashi.