10 citations · 34 across the 20 of their papers we have counts for
22 papers
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…
Perfect codes in Cayley graphs of Hajós groups
Yusuf Hafidh, Binzhou Xia, Sanming Zhou
A perfect code in a graph is a subset of the vertex set of such that every vertex of outside has exactly one neighbour in . A perfect code in a directed grap…
Which maximal subgroups are perfect codes?
Shouhong Qiao, Ning Su, Binzhou Xia +2
A perfect code in a graph is a subset of such that no two vertices in are adjacent and every vertex in is adjacent to exactly one vertex in $…
Determining the vertex stabilizers of 4-valent half-arc-transitive graphs
Binzhou Xia, Zhishuo Zhang, Sanming Zhou
We say that a group is a -HAT-stabilizer if it is the vertex stabilizer of some connected -valent half-arc-transitive graph. In 2001, Marušič and Nedela proved that every …
A family of symmetric graphs in relation to 2-point-transitive linear spaces
Teng Fang, Sanming Zhou, Shenglin Zhou
A graph is -symmetric if it admits as a group of automorphisms acting transitively on the set of arcs of , where an arc is an ordered pair of adjacent vertices. Let $…
The second largest eigenvalue of some nonnormal Cayley graphs on symmetric groups
Yuxuan Li, Binzhou Xia, Sanming Zhou
A Cayley graph on the symmetric group is said to have the Aldous property if its strictly second largest eigenvalue (that is, the largest eigenvalue strictly smaller than the…
The second largest eigenvalue of normal Cayley graphs on symmetric groups generated by cycles
Yuxuan Li, Binzhou Xia, Sanming Zhou
We study the normal Cayley graphs on the symmetric group , where and is the set of all cycles in with…
Stability of graph pairs involving vertex-transitive graphs
Yan-Li Qin, Binzhou Xia, Sanming Zhou
A pair of graphs is said to be stable if the full automorphism group of is isomorphic to the product of the full automorphism groups of and and unstable…
A solution to Babai's problem on digraphs with non-diagonalizable adjacency matrix
Yuxuan Li, Binzhou Xia, Sanming Zhou +1
The fact that the adjacency matrix of every finite graph is diagonalizable plays a fundamental role in spectral graph theory. Since this fact does not hold in general for digraphs,…
Aldous' spectral gap property for normal Cayley graphs on symmetric groups
Yuxuan Li, Binzhou Xia, Sanming Zhou
Aldous' spectral gap conjecture states that the second largest eigenvalue of any connected Cayley graph on the symmetric group Sn with respect to a set of transpositions is achieve…
Cubic graphical regular representations of some classical simple groups
Binzhou Xia, Shasha Zheng, Sanming Zhou
A graphical regular representation (GRR) of a group is a Cayley graph of whose full automorphism group is equal to the right regular permutation representation of . In t…
Subgroup regular sets in Cayley graphs
Yanpeng Wang, Binzhou Xia, Sanming Zhou
Let be a graph with vertex set , and let and be nonnegative integers. A subset of is called an -regular set in if every vertex in has exactly…
Stability of pair graphs
Yan-Li Qin, Binzhou Xia, Jin-Xin Zhou +1
We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs is st…
Regular sets in Cayley graphs
Yanpeng Wang, Binzhou Xia, Sanming Zhou
In a graph with vertex set , a subset of is called an -perfect set if every vertex in has exactly neighbors in and every vertex in …
An explicit characterization of arc-transitive circulants
Cai Heng Li, Binzhou Xia, Sanming Zhou
A reductive characterization of arc-transitive circulants was given independently by Kovacs in 2004 and the first author in 2005. In this paper, we give an explicit characterizatio…
Canonical double covers of generalized Petersen graphs, and double generalized Petersen graphs
Yan-Li Qin, Binzhou Xia, Sanming Zhou
The canonical double cover $\D(Γ)$ of a graph is the direct product of and . If $\Aut(\D(Γ))\cong\Aut(Γ)\times\ZZ_2$ then is called stable; otherwise is called…
Stability of circulant graphs
Yan-Li Qin, Binzhou Xia, Sanming Zhou
The canonical double cover of a graph is the direct product of and . If then is cal…
Cores of imprimitive symmetric graphs of order a product of two distinct primes
Ricky Rotheram, Sanming Zhou
A retract of a graph is an induced subgraph of such that there exists a homomorphism from to whose restriction to is the identity map. A graph is a core if…
Classification of tetravalent -transitive non-normal Cayley graphs of finite simple groups
Xin Gui Fang, Jie Wang, Sanming Zhou
A graph is called -arc-transitive if is transitive on the set of vertices of and the set of -arcs of , where for an integer …
Perfect codes in Cayley graphs
He Huang, Binzhou Xia, Sanming Zhou
Given a graph , a subset of is called a perfect code in if every vertex of is at distance no more than one to exactly one vertex in , and a subset of $…
Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks
Teng Fang, Xin Gui Fang, Binzhou Xia +1
A graph is called -symmetric if it admits as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $…
Symmetric graphs with 2-arc transitive quotients
Guangjun Xu, Sanming Zhou
A graph $\Ga$ is -symmetric if $\Ga$ admits as a group of automorphisms acting transitively on the set of vertices and the set of arcs of $\Ga$, where an arc is an ordered p…