Determining Finite Connected Graphs Along the Quadratic Embedding Constants of Paths

Abstract

The QE constant of a finite connected graph $G$, denoted by $\mathrm{QEC}(G)$, is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two. We prove that the QE constants of paths $P_n$ form a strictly increasing sequence converging to $-1/2$. Then we formulate the problem of determining all the graphs $G$ satisfying $\mathrm{QEC}(P_n)\le\mathrm{QEC}(G)<\mathrm{QEC}(P_{n+1})$. The answer is given for $n=2$ and $n=3$ by exploiting forbidden subgraphs for $\mathrm{QEC}(G)<-1/2$ and the explicit QE constants of star products of the complete graphs.