Optimal embedding and spectral gap of a finite graph
From MaRDI portal
Publication:6334458
arXiv2002.03584MaRDI QIDQ6334458FDOQ6334458
Authors: Toshimasa Kobayashi, Takefumi Kondo, Shin Nayatani 
Publication date: 10 February 2020
Abstract: We introduce a new optimization problem regarding embeddings of a graph into a Euclidean space and discuss its relation to the two, mutually dual, optimizations problems introduced by Goering-Helmberg-Wappler. We prove that the Laplace eigenvalue maximization problem of Goering et al is also dual to our embedding optimization problem. We solve the optimization problems for generalized polygons and graphs isomorphic to the one-skeltons of regular and semi-regular polyhedra.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph representations (geometric and intersection representations, etc.) (05C62)
This page was built for publication: Optimal embedding and spectral gap of a finite graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6334458)
