Quadratic embedding constants of fan graphs and graph joins

Abstract

We derive a general formula for the quadratic embedding constant of a graph join Km+G, where Km is the empty graph on m1 vertices and G is an arbitrary graph. Applying our formula to a fan graph K1+Pn, where K1=K1 is the singleton graph and Pn is the path on n1 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=(An), where the right-hand side is the An minimal eigenvalue of the adjacency matrix An of Pn. For an odd n we show that (An+1)αn<(An).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…