An exact enumeration of vertex connectivity of the enhanced power graphs of finite nilpotent groups
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_ | 1866909187933470720 |
|---|---|
| author | Bera, Sudip Dey, Hiranya Kishore |
| author_facet | Bera, Sudip Dey, Hiranya Kishore |
| contents | The enhanced power graph of a group $G$ is a graph with vertex set $G,$ where two distinct vertices $x$ and $y$ are adjacent if and only if there exists an element $w$ in $G$ such that both $x$ and $y$ are powers of $w.$ In this paper, we determine the vertex connectivity of the enhanced power graph of any finite nilpotent group. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_01027 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An exact enumeration of vertex connectivity of the enhanced power graphs of finite nilpotent groups Bera, Sudip Dey, Hiranya Kishore Combinatorics Group Theory 05C25, 20D15, 05A15 The enhanced power graph of a group $G$ is a graph with vertex set $G,$ where two distinct vertices $x$ and $y$ are adjacent if and only if there exists an element $w$ in $G$ such that both $x$ and $y$ are powers of $w.$ In this paper, we determine the vertex connectivity of the enhanced power graph of any finite nilpotent group. |
| title | An exact enumeration of vertex connectivity of the enhanced power graphs of finite nilpotent groups |
| topic | Combinatorics Group Theory 05C25, 20D15, 05A15 |
| url | https://arxiv.org/abs/2405.01027 |