Quadratic embedding constants of fan graphs and graph joins

Wojciech Młotkowski, Nobuaki Obata

Research output: Contribution to journalArticlepeer-review

Abstract

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=min⁡ev(An), where the right-hand side is the minimal eigenvalue of the adjacency matrix An of Pn. For an odd n we show that min⁡ev(An+1)≤α˜n<min⁡ev(An).

Original languageEnglish
Pages (from-to)58-91
Number of pages34
JournalLinear Algebra and Its Applications
Volume709
DOIs
Publication statusPublished - 2025 Mar 15

Keywords

  • Chebyshev polynomial
  • Distance matrix
  • Fan graph
  • Graph join
  • Quadratic embedding constant

Fingerprint

Dive into the research topics of 'Quadratic embedding constants of fan graphs and graph joins'. Together they form a unique fingerprint.

Cite this