On result involution graphs of finite groups (Q6870004)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8149310
Language Label Description Also known as
default for all languages
No label defined
    English
    On result involution graphs of finite groups
    scientific article; zbMATH DE number 8149310

      Statements

      On result involution graphs of finite groups (English)
      0 references
      0 references
      0 references
      0 references
      21 January 2026
      0 references
      The \textit{result involution graph} of a finite group \(G\), defined by \textit{A. Asaad} and \textit{S. Mohammed} [J. Zankoy Sulaimani, 23, No. 3, 113--118 (2021; \url{doi:10.17656/jzs.10846})], is the simple undirected graph \(\Gamma_G^{RI}\) with vertex set \(G\) where two distinct elements \(x,y\in G\) are adjacent if and only if \(xy\) (equivalently, \(yx\)) is an involution. In the paper under review, the authors show that \(\Gamma_G^{RI}\) is connected if and only if \(G\) admits a generating set consisting of involutions and they give exact descriptions of the groups \(G\) for which \(\Gamma_G^{RI}\) is complete or complete bipartite. The authors then focus on three particular families of \(2\)-groups and explicitly describe the structures of their associated result involution graphs. These families are the ``Semi-dihedral groups'' \(SD_{2^n}\), the ``Quasi-dihedral groups'' \(QD_{2^n}\) and the groups of the form \(\mathbb{Z}_{2^{n-1}}\times \mathbb{Z}_2\). The groups \(QD_{2^n}\) and \(\mathbb{Z}_{2^{n-1}}\times \mathbb{Z}_2\) turn out to have isomorphic result involution graphs whenever \(n\ge 4\) and the paper ends with the proposal of a related open problem: the classification of all pairs of non-isomorphic groups with isomorphic result involution graphs.
      0 references
      0 references
      finite group
      0 references
      result involution graph
      0 references
      connected graph
      0 references
      complete graph
      0 references
      complete bipartite graph
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references