4 papers
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…
Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups
Xueyi Huang, Lu Lu, Xiongfeng Zhan
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavič and Potočnik proposed the problem of charaterizing distance-regular Cayl…
Distance-regular Cayley graphs over
Xiongfeng Zhan, Lu Lu, Xueyi Huang
In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavič and Potočnik proposed the problem of characterizing distance-regular Cay…