TY - JOUR
T1 - Quadratic embedding constants of fan graphs and graph joins
AU - Młotkowski, Wojciech
AU - Obata, Nobuaki
N1 - Publisher Copyright:
© 2025 The Author(s)
PY - 2025/3/15
Y1 - 2025/3/15
N2 - We derive a general formula for the quadratic embedding constant of a graph join K¯m+G, where K¯m is the empty graph on m≥1 vertices and G is an arbitrary graph. Applying our formula to a fan graph K1+Pn, where K1=K¯1 is the singleton graph and Pn is the path on n≥1 vertices, we show that QEC(K1+Pn)=−α˜n−2, where α˜n is the minimal zero of a new polynomial Φn(x) related to Chebyshev polynomials of the second kind. Moreover, for an even n we have α˜n=minev(An), where the right-hand side is the minimal eigenvalue of the adjacency matrix An of Pn. For an odd n we show that minev(An+1)≤α˜nn).
AB - We derive a general formula for the quadratic embedding constant of a graph join K¯m+G, where K¯m is the empty graph on m≥1 vertices and G is an arbitrary graph. Applying our formula to a fan graph K1+Pn, where K1=K¯1 is the singleton graph and Pn is the path on n≥1 vertices, we show that QEC(K1+Pn)=−α˜n−2, where α˜n is the minimal zero of a new polynomial Φn(x) related to Chebyshev polynomials of the second kind. Moreover, for an even n we have α˜n=minev(An), where the right-hand side is the minimal eigenvalue of the adjacency matrix An of Pn. For an odd n we show that minev(An+1)≤α˜nn).
KW - Chebyshev polynomial
KW - Distance matrix
KW - Fan graph
KW - Graph join
KW - Quadratic embedding constant
UR - http://www.scopus.com/inward/record.url?scp=85215084180&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85215084180&partnerID=8YFLogxK
U2 - 10.1016/j.laa.2025.01.001
DO - 10.1016/j.laa.2025.01.001
M3 - Article
AN - SCOPUS:85215084180
SN - 0024-3795
VL - 709
SP - 58
EP - 91
JO - Linear Algebra and Its Applications
JF - Linear Algebra and Its Applications
ER -