The largest Laplacian eigenvalue and the balancedness of simplicial complexes
Abstract
Let be a simplical complex, and let be the -th up Laplacian and signless Laplacian of , respectively. In this paper we proved that the largest eigenvalue of is not greater than the largest eigenvalue of ; furthermore, if is -path connected, then the equality holds if and only if the -th incidence signed graph of is balanced. As an application we provided an upper bound for the largest eigenvalue of the -th up Laplacian of , which improves the bound given by Horak and Jost and generalizes the result of Anderson and Morley on graphs.We characterized the balancedness of simplicial complexes under operations such as wedge sum, join, Cartesian product and duplication of motifs. For each , by using wedge sum or duplication of motifs, we can construct an infinitely many -path connected simplicial complexes with being balanced.
Keywords
Cite
@article{arxiv.2405.19078,
title = {The largest Laplacian eigenvalue and the balancedness of simplicial complexes},
author = {Yi-Zheng Fan and Hui-Feng Wu and Yi Wang},
journal= {arXiv preprint arXiv:2405.19078},
year = {2025}
}