4 papers
Almost all standard double covers of abelian Cayley graphs have smallest possible automorphism groups
Binzhou Xia, Zhishuo Zhang, Shasha Zheng
The standard double cover of a graph is the direct product . A graph is said to be stable if all the automorphisms of come from its factors. Alth…
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 …
On subgroup perfect codes in vertex-transitive graphs
Binzhou Xia, Junyang Zhang, Zhishuo Zhang
A subset of the vertex set of a graph is called a perfect code in if every vertex in is adjacent to exactly one vertex in . Given a group and…