Key points are not available for this paper at this time.
Let Gₙ=Zₙ Zₙ for n 4 and S=\ (i, 0), (0, i), (i, i): 1 i n-1\ Gₙ. Define (n) to be the Cayley graph of Gₙ with respect to the connecting set S. It is known that (n) is a strongly regular graph with the parameters (n², 3n-3, n, 6) 19. Hence (n) 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 (n). Then by determining the automorphism group of this family of graphs, we show that the graphs under study are not distance transitive.
Das et al. (Sat,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: