Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2601.08171

Maximizing the signless Laplacian spectral radius of simplicial 2-complexes with a prescribed second Betti number

Chuan-Ming She·Yi-Zheng Fan·Yi-Min Song
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study how a prescribed second Betti number constrains the largest eigenvalue of the signless Laplacian on edges of a pure two-dimensional simplicial complex. For each fixed positive second Betti number, we determine all maximizing complexes provided that the number of vertices is sufficiently large. Every maximizer consists of a full cone over a complete graph together with a family of triangles avoiding the apex, any two of which share an edge; the number of added triangles equals the prescribed Betti number. The maximizer is unique up to isomorphism except when this number is three or four, for which we describe all additional extremal complexes. The proof uses homological constraints and Perron vector estimates to establish the full cone structure, followed by an exact Schur complement comparison to classify the added triangles. We also obtain an asymptotic expansion of the maximum spectral radius and extend the extremal result to Betti numbers growing more slowly than the fourth root of the number of vertices. These results provide a two-dimensional counterpart of spectral extremal theorems for connected graphs with a prescribed cyclomatic number.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chuan-Ming She, Yi-Zheng Fan, Yi-Min Song. 2026-09-12. Maximizing the signless Laplacian spectral radius of simplicial 2-complexes with a prescribed second Betti number. https://arxiv.org/abs/2601.08171

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗