paper

Automorphism group of a family of distance regular graphs which are not distance transitive

arXiv:2403.01293

Abstract

Let for and . Define to be the Cayley graph of with respect to the connecting set . It is known that is a strongly regular graph with the parameters \cite{19}. Hence is a distance regular graph. It is known that every distance transitive graph is distance regular, but the converse is not true. In this paper, we study some algebraic properties of the graph . Then by determining the automorphism group of this family of graphs, we show that the graphs under study are not distance transitive.

11 pages