Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks

Teng Fang, Xin Gui Fang, Binzhou Xia +1

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $…