Quadratic Embedding Constants of Corona Graphs
Ferdi, Edy Tri Baskoro, Nobuaki Obata, Aditya Purwa Santika

TL;DR
This paper derives a formula for the quadratic embedding constant of corona graphs, linking it to spectral properties of the component graphs and providing explicit formulas for certain regular graphs.
Contribution
The paper introduces a new formula for the QEC of corona graphs, connecting it to eigenvalues and inverse functions of an analytic function based on the component graph's spectrum.
Findings
Derived a formula for QEC of corona graphs
Established spectral conditions for the formula to hold
Provided explicit formulas for regular graphs with specific eigenvalues
Abstract
The quadratic embedding constant (QEC) of a connected graph is defined to be the maximum of the quadratic function associated with its distance matrix on a certain unit sphere of codimension two. In this paper we derive a formula for the QEC of a corona graph . It is shown that holds under some spectral assumptions on , where is the inverse function of the most right branch of the analytic function defined by means of the main eigenvalues of the adjacency matrix of . Moreover, if is a regular graph of which the adjacency matrix has the smallest eigenvalue , then the formula is written down explicitly.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Complex Network Analysis Techniques
