Skip to content
Preprint

Structure theorems for Lichnerowicz-sharp graphs

Aug 2026 · 0 citations · 48 references
Mathematics

Abstract

Hypercube graphs are fundamental model spaces of positive curvature in discrete comparison geometry. Let $G$ be a finite, connected, simple, unweighted graph with Bakry--\'Emery curvature bounded below by $K$. We call $G$ Lichnerowicz-sharp if its first non-zero non-normalized Laplacian eigenvalue $\lambda_1=K$. We prove that, after removing a canonical collection of edges on which every $K$-eigenfunction is constant, the resulting graph has a canonical bundle structure. Its fibers are regular, have similar structure with hypercubes, and are Laplacian-cospectral with hypercubes, although they need not themselves be hypercubes. If the base graph is nontrivial, then it satisfies $\mathrm{CD}(K,\infty)$ and has first eigenvalue strictly greater than $K$. As a consequence, if the vertex degree in $G$ is constant along each canonical fiber, then every fiber is a hypercube and $G$ is a hypercube bundle. Conversely, for every $d\geq 4$, we construct Lichnerowicz-sharp graphs with non-hypercube canonical fibers of degree $d$.

View source

Similar papers

Preprint Sep 2026

Characterization of graphs attaining the maximum signless Laplacian spectral radius under forbidden cycles and theta graphs

Spectral Tur\'an-type problems ask how the absence of prescribed subgraphs constrains the spectral radius of a matrix associated with a graph. Given a family of graphs $\mathcal{F}$, a graph is called $\mathcal{F}$-free if it contains no member of $\mathcal{F}$ as a subgraph. The theta graph $\theta(l_1,\ldots,l_k)$ co...

M. Basunia, P. Panigrahi · 0 citations
Preprint Sep 2026

On some k-fold generalizations of Lov\'asz theta and their sandwich theorems

We study several $k$-fold generalizations of the Lov\'asz theta function associated with the maximum $k$-colorable induced subgraph problem. The first is the Narasimhan--Manber parameter $\vartheta_k$. We prove that, for graphs whose adjacency matrix belongs to a homogeneous partially coherent algebra, this parameter i...

Marcel K. Carli Silva, Gabriel Coutinho, Thiago Oliveira et al. · 0 citations
Preprint Aug 2026

Ramanujan Cayley Graphs with Normal Connection Sets in Ratio-One Frobenius Groups

Let $G=N\rtimes H$ be a finite Frobenius group with $|N|=q$ and $|H|=q-1$. We classify all Ramanujan Cayley graphs of $G$ whose connection sets are normal, in the sense of being unions of conjugacy classes. The group-theoretic input is a simple blow-up phenomenon: every such Cayley graph is either $Y[\overline{K_q}]$ o...

Ming-Hsuan Kang, Chi-Jung Yang · 0 citations
Preprint Aug 2026

Extremal graphs for a conjecture on the square energy of graphs

For a graph $G$, let $s^+(G)$ and $s^-(G)$ denote the sums of the squares of its positive and negative adjacency eigenvalues. We determine all equality cases in the conjecture of Elphick, Farber, Goldberg, and Wocjan that every connected graph $G$ on $n$ vertices satisfies \[ \min \{s^+(G),s^-(G)\}\ge n-1. \] Namely, e...

Fu-Tao Hu, Ya-Yang Liu, Yi Wang · 1 citation
Preprint Aug 2026

Periodic quasiflats in hierarchically hyperbolic spaces

We prove a quasiflat closing theorem and a coarse flat torus theorem for hierarchically hyperbolic groups (HHGs). Namely, given an HHG $G$, we prove that $G$ is hyperbolic if and only if it contains no $\mathbb Z^2$ subgroups and, if $A\leq G$ is virtually $\mathbb Z^n$, then there is an $A$--invariant $n$--dimensional...

Pénélope Azuelos, M. Hagen · 0 citations
Preprint Aug 2026

On Eigenvalue Bounds for Bounded Genus Graphs and Minor-Free Graphs

In this paper, we resolve a 30-year-old conjecture of Spielman and Teng concerning the performance of the spectral partitioning method on graphs embeddable on an orientable surface of genus $g\ge 1$. In particular, for such a graph $G$ with $n$ vertices and maximum degree $\Delta$, we show that the second-smallest eige...

Benedikt Kolbe, Jack Spalding-Jamieson · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.