10 papers
Automorphism groups of endomorphism monoids of -unit -valent circulant digraphs
Chenhui Lv
Let $G=\Cay(\mathbb{Z}_n,S)$ be a -valent circulant digraph with connection set , where and . Determining the automorphism group…
The Aldous property for normal Cayley graphs on symmetric groups
Chenhui Lv, Sanming Zhou
Aldous' spectral gap conjecture states that the random walk and the interchange process on any connected graph have the same spectral gap, or, equivalently, the second largest eige…
Amply regular graphs with close to half the valency and group divisible designs
Wei Jin, Jack H. Koolen, Chenhui Lv
In this paper, we classify connected amply regular graphs with diameter and parameters satisfying , where is odd. We prove tha…
Kleitman's theorem over vector spaces: parity phenomena in canonical and global stability
Chenhui Lv, Zixiang Xu
In 1966, Kleitman determined the maximum size of a family of subsets of with bounded symmetric difference. Liao, Liu and Yan recently established a vector-space analogue in t…
On the characterization of geometric distance-regular graphs
Chenhui Lv, Jack H. Koolen
In 2010, Koolen and Bang proposed the following conjecture: For a fixed integer , any geometric distance-regular graph with smallest eigenvalue , diameter …
Comparing classes of highly symmetric graphs: From -arc-transitive to -distance-transitive
Wei Jin, Jack H. Koolen, Chenhui Lv
A -distance-transitive graph is a vertex-transitive graph whose vertex stabilizer is transitive on both the first- and second-step neighborhoods. This concept simultaneously gen…