On the deep commuting graph of a finite group
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912715058970624 |
|---|---|
| author | Hatui, Sumana Mukherjee, Sanjay Patra, Kamal Lochan |
| author_facet | Hatui, Sumana Mukherjee, Sanjay Patra, Kamal Lochan |
| contents | Let $G$ be a finite group and let $\tilde{G}$ be a Schur cover of $G$. The deep commuting graph $Δ_D(G)$ of $G$ is a simple graph with vertex set $G$, where two distinct vertices are adjacent if their pre-images commute in $\tilde{G}$. The deep commuting graph of a finite group was first introduced in [P. J. Cameron and B. Kuzma, Between the enhanced power graph and the commuting graph, {\it J. Graph Theory} {\bf 102} (2023), no. 2, 295--303], where the authors have shown that $Δ_D(G)$ is fixed irrespective of the choice of the Schur cover $\tilde{G}$. In this paper, we first prove that $Δ_D(G)$ is complete if and only if $G$ is cyclic. Also, we classify finite simple groups, symmetric groups and alternating groups, for which $Δ_D(G)$ is perfect. In addition, explore several other properties of $Δ_D(G)$ like Eulerianess, universality and connectedness of reduced deep commuting graphs.
Next, we classify the finite abelian groups for which deep commuting graphs coincide with enhance power graphs. We also characterize the dominant vertices for the deep commuting graphs of finite abelian groups and examine the connectedness of the associated reduced deep commuting graphs. These properties of the deep commuting graphs for the non abelian groups like symmetric groups, alternating groups, dihedral groups, generalized quaternion group and Heisenberg groups are also discussed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_13303 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the deep commuting graph of a finite group Hatui, Sumana Mukherjee, Sanjay Patra, Kamal Lochan Group Theory Combinatorics Let $G$ be a finite group and let $\tilde{G}$ be a Schur cover of $G$. The deep commuting graph $Δ_D(G)$ of $G$ is a simple graph with vertex set $G$, where two distinct vertices are adjacent if their pre-images commute in $\tilde{G}$. The deep commuting graph of a finite group was first introduced in [P. J. Cameron and B. Kuzma, Between the enhanced power graph and the commuting graph, {\it J. Graph Theory} {\bf 102} (2023), no. 2, 295--303], where the authors have shown that $Δ_D(G)$ is fixed irrespective of the choice of the Schur cover $\tilde{G}$. In this paper, we first prove that $Δ_D(G)$ is complete if and only if $G$ is cyclic. Also, we classify finite simple groups, symmetric groups and alternating groups, for which $Δ_D(G)$ is perfect. In addition, explore several other properties of $Δ_D(G)$ like Eulerianess, universality and connectedness of reduced deep commuting graphs. Next, we classify the finite abelian groups for which deep commuting graphs coincide with enhance power graphs. We also characterize the dominant vertices for the deep commuting graphs of finite abelian groups and examine the connectedness of the associated reduced deep commuting graphs. These properties of the deep commuting graphs for the non abelian groups like symmetric groups, alternating groups, dihedral groups, generalized quaternion group and Heisenberg groups are also discussed. |
| title | On the deep commuting graph of a finite group |
| topic | Group Theory Combinatorics |
| url | https://arxiv.org/abs/2511.13303 |