Automorphism group of a family of distance regular graphs which are not distance transitive
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914391568416768 |
|---|---|
| author | Das, Angsuman Mirafzal, S. Morteza |
| author_facet | Das, Angsuman Mirafzal, S. Morteza |
| contents | Let $G_n=\mathbb{Z}_n\times \mathbb{Z}_n$ for $n\geq 4$ and $S=\{(i,0),(0,i),(i,i): 1\leq i \leq n-1\}\subset G_n$. Define $Γ(n)$ to be the Cayley graph of $G_n$ with respect to the connecting set $S$. It is known that $Γ(n)$ is a strongly regular graph with the parameters $(n^2,3n-3,n,6)$ \cite{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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_01293 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Automorphism group of a family of distance regular graphs which are not distance transitive Das, Angsuman Mirafzal, S. Morteza Combinatorics 05C25 Let $G_n=\mathbb{Z}_n\times \mathbb{Z}_n$ for $n\geq 4$ and $S=\{(i,0),(0,i),(i,i): 1\leq i \leq n-1\}\subset G_n$. Define $Γ(n)$ to be the Cayley graph of $G_n$ with respect to the connecting set $S$. It is known that $Γ(n)$ is a strongly regular graph with the parameters $(n^2,3n-3,n,6)$ \cite{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. |
| title | Automorphism group of a family of distance regular graphs which are not distance transitive |
| topic | Combinatorics 05C25 |
| url | https://arxiv.org/abs/2403.01293 |