The largest normalized Laplacian eigenvalue and incidence balancedness of simplicial complexes
Abstract
Let be a simplicial complex, and let be the -th up normalized Laplacian of . Horak and Jost showed that the largest eigenvalue of is at most , and characterized the equality case by the orientable or non-orientable circuits. In this paper, by using the balancedness of signed graphs, we show that has an eigenvalue if and only if has an -path connected component such that the -th signed incidence graph is balanced, which implies Horak and Jost's characterization. We also characterize the multiplicity of as an eigenvalue of , which generalizes the corresponding result in graph case. Finally we gave some classes of infinitely many simplicial complexes with having an eigenvalue by using wedge, Cartesian product and duplication of motifs.
Keywords
Cite
@article{arxiv.2407.13791,
title = {The largest normalized Laplacian eigenvalue and incidence balancedness of simplicial complexes},
author = {Yi-min Song and Hui-Feng Wu and Yi-Zheng Fan},
journal= {arXiv preprint arXiv:2407.13791},
year = {2025}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2405.19078