Finite groups with isomorphic non-commuting graphs have the same nilpotency property (Q6140037)

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 7791760
Language Label Description Also known as
default for all languages
No label defined
    English
    Finite groups with isomorphic non-commuting graphs have the same nilpotency property
    scientific article; zbMATH DE number 7791760

      Statements

      Finite groups with isomorphic non-commuting graphs have the same nilpotency property (English)
      0 references
      0 references
      19 January 2024
      0 references
      Let \(G\) be a non-abelian group and \(Z(G)\) be its center. The non-commuting graph \(\Gamma(G)\) of \(G\) is the graph whose vertex set is \(G\setminus Z(G)\) and two vertices \(x\) and \(y\) are adjacent if and only if \(xy \not = yx\). The non-commuting graph of a group was first considered by Paul Erdős (see [\textit{B. H. Neumann}, J. Aust. Math. Soc., Ser. A 21, 467--472 (1976; Zbl 0333.05110)]). In the paper under review, the author proves that if \(G\) and \(H\) are non-abelian groups with isomorphic non-commuting graphs and \(G\) is nilpotent, then \(H\) is nilpotent, provided \(|Z(G)|\geq |Z (H)|\). This answers a conjecture formulated in [\textit{V. Grazian} and \textit{C. Monetta}, J. Algebra 633, 389--402 (2023; Zbl 1523.20035)].
      0 references
      0 references
      non-commuting graph
      0 references
      nilpotent group
      0 references
      graph isomorphism
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references