no. 16 · Tuesday 17 November 2026
Quadratic Embedding Constants of Block Graphs and Characterization of Cactus-like Graphs
Abstract
A (finite or infinite) connected graph is called \textit{cactus-like} if every pair of distinct maximal cliques has at most one vertex in common and its clique graph is a tree. Equivalently, a cactus-like graph is a block graph whose clique graph is a tree. We prove that a finite connected graph $G$ with at least two vertices is cactus-like if and only if its quadratic embedding constant satisfies $\mathrm{QEC}(G)<-1/2$. Moreover, we establish upper and lower bounds for $\mathrm{QEC}(G)$ in terms of the clique degree of a block graph $G$. For the proofs, we develop a method for constructing a conditionally negative definite kernel on a block graph by concatenating local kernels along geodesics in the block graph. Concrete examples include free products of complete graphs and trees.
- fields
- Combinatorics