Embedding and the first Laplace eigenvalue of a finite graph

Abstract

Göring–Helmberg–Wappler introduced optimization problems regarding embeddings of a graph into a Euclidean space and the first nonzero eigenvalue of the Laplacian of a graph, which are dual to each other in the framework of semidefinite programming. In this paper, we introduce a new graph-embedding optimization problem, and discuss its relation to Göring–Helmberg–Wappler’s problems. We also identify the dual problem to our embedding optimization problem. We solve the optimization problems for distance-regular graphs and the one-skeleton graphs of the \(\textrm{C}_{60}\) fullerene and some other Archimedian solids.