45 citations · 48 across the 20 of their papers we have counts for
4 papers · 1 filter
An Extension of Pólya's Enumeration Theorem
Xiongfeng Zhan, Xueyi Huang
In combinatorics, Pólya's Enumeration Theorem is a powerful tool for solving a wide range of counting problems, including the enumeration of groups, graphs, and chemical compounds.…
Proof of Lew's conjecture on the spectral gaps of simplicial complexes
Xiongfeng Zhan, Xueyi Huang, Huiqiu Lin
As a generalization of graph Laplacians to higher dimensions, the combinatorial Laplacians of simplicial complexes have garnered increasing attention. Let be a simplicial compl…
Fourier analysis on distance-regular Cayley graphs over abelian groups
Xiongfeng Zhan, Xueyi Huang, Lu Lu
The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past hal…
On the spectral extremal problem of planar graphs
Xiaolong Wang, Xueyi Huang, Huiqiu Lin
The spectral extremal problem of planar graphs has aroused a lot of interest over the past three decades. In 1991, Boots and Royle [Geogr. Anal. 23(3) (1991) 276--282] (and Cao and…