Quadratic embedding constants of fan graphs and graph joins
arXiv:2403.16348 · doi:10.1016/j.laa.2025.01.001
Abstract
We derive a general formula for the quadratic embedding constant of a graph join , where is the empty graph on vertices and is an arbitrary graph. Applying our formula to a fan graph , where is the singleton graph and is the path on vertices, we show that , where is the minimal zero of a new polynomial related to Chebyshev polynomials of the second kind. Moreover, for an even we have , where the right-hand side is the An minimal eigenvalue of the adjacency matrix of . For an odd we show that .