Finite groups with isomorphic non-commuting graphs have the same nilpotency property
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)].
- A conjecture related to the nilpotency of groups with isomorphic non-commuting graphs
- Commutativity pattern of finite non-Abelian p-groups determine their orders.
- scientific article; zbMATH DE number 3520437 (Why is no real title available?)
- scientific article; zbMATH DE number 857570 (Why is no real title available?)
- Non-commuting graph of a group.
- Non-commuting graphs of nilpotent groups.
- On the number of solutions of Goormaghtigh equation for given \(x\) and \(y\)
- Simple groups are characterized by their non-commuting graphs
This page was built for publication: Finite groups with isomorphic non-commuting graphs have the same nilpotency property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140037)