activity
20242026
collaborators

6 papers

math.GR2026

The finite -set homogeneous graphs

Cai Heng Li, Fu-Gang Yin, Jin-Xin Zhou

A classification is given of finite -set-homogeneous graphs for , leading to a striking result that each finite -set-homogeneous graph is -homogeneous. It sh…

math.CO2025

On kernel isomorphisms of -Cayley digraphs and finite PCI-groups

Xing Zhang, Yan-Quan Feng, Jin-Xin Zhou +1

The isomorphism problem for digraphs is a fundamental problem in graph theory. In this paper, we consider this problem for -Cayley digraphs which are generalization of Cayley di…

math.GR2025

Normal and non-normal Cayley digraphs on cyclic and dihedral groups

Jun-Feng Yang, Yan-Quan Feng, Fu-Gang Yin +1

A Cayley digraph on a group is called NNN if the Cayley digraph is normal and its automorphism group contains a non-normal regular subgroup isomorphic to . A group is called…

math.GR2024

Symmetric Cayley graphs on non-abelian simple groups of valency 7

Xing Zhang, Yan-Quan Feng, Fu-Gang Yin +1

Let be a connected -valent symmetric Cayley graph on a finite non-abelian simple group . If is not normal, Li {\em et al.} [On 7-valent symmetric Cayley graphs of fin…

math.CO2024

On isomorphisms of -Cayley digraphs

Xing Zhang, Yuan-Quan Feng, Fu-Gang Yin +1

The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In t…

math.CO2024

The classification of two-distance transitive dihedrants

Jun-Jie Huang, Yan-Quan Feng, Jin-Xin Zhou +1

A vertex transitive graph is said to be -distance transitive if for each vertex , the group of automorphisms of fixing the vertex acts transitively on the set of…