Prime-valent Symmetric graphs with a quasi-semiregular automorphism

Fu-Gang Yin, Yan-Quan Feng, Jin-Xin Zhou +1

An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was f…