Commuting graph of \(A \)-orbits (Q831206): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1908.06867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-commuting graph of a group. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite groups with conditions on the centralizers of p-elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups with the same non-commuting graph. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locally finite groups in which every element has prime power order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solvability criterion for finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centers of Sylow subgroups and automorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Commuting Graph on Conjugacy Classes of Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free commuting conjugacy class graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of the commuting graph of a finite group with trivial centre. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The commuting graph of a soluble group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple groups are characterized by their non-commuting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adjacency Criterion for the Prime Graph of a Finite Simple Group / rank
 
Normal rank

Latest revision as of 18:55, 25 July 2024

scientific article
Language Label Description Also known as
English
Commuting graph of \(A \)-orbits
scientific article

    Statements

    Commuting graph of \(A \)-orbits (English)
    0 references
    0 references
    0 references
    11 May 2021
    0 references
    Let \(G\) be a finite group, and let \(A\) be a group acting on \(G\) through automorphisms (without loss of generality, one may assume that \(A\leq\operatorname{Aut}(G)\)). The authors introduce and study the simple undirected graph \(\Gamma(G,A)\), the vertices of which are the \(A\)-orbits \(x^A\) of nontrivial elements \(x\in G\), with two vertices \(x^A\) and \(y^A\) joined by an edge if and only if \(x'y'=y'x'\) for some \(x'\in x^A\) and some \(y'\in y^A\). For \(A=\{\operatorname{id}\}\), this is essentially the so-called commuting graph of \(G\), dating back to a seminal paper of \textit{R. Brauer} and \textit{K. A. Fowler} [Ann. Math. (2) 62, 565--583 (1955; Zbl 0067.01004)] and studied by many authors since. For \(A=\operatorname{Inn}(G)\), it is essentially the graph introduced by \textit{M. Herzog} et al. [Commun. Algebra 37, No. 10, 3369--3387 (2009; Zbl 1187.20027)]. Due to these, and other, connections of \(\Gamma(G,A)\) with known concepts, many results of the reviewed paper are either generalizations of, or at least have some connection with, known results by various authors. For example, \begin{itemize} \item Theorem 2.1 states that \(G\) is nilpotent if for all primes \(p\not=q\) and all \(p\)-elements \(x\) and \(q\)-elements \(y\) of \(G\), there is an \(a=a(x,y)\in A\) such that the subgroup \(\langle x,y^a\rangle\) is nilpotent. Since \(\langle x,y^a\rangle\) is nilpotent for some \(a\) if and only if \([x,y^a]=1\) for some \(a\) if and only if \(x^A\sim y^A\) in \(\Gamma(G,A)\), it follows in particular that \(G\) is nilpotent if \(\Gamma(G,A)\) is a complete graph (Theorem 3.1). For \(A=\{\operatorname{id}\}\), Theorem 2.1 is one implication in the well-known criterion that \(G\) is nilpotent if and only if any two elements of coprime prime-power order commute. \item Theorem 2.2: Like Theorem 2.1, but replacing ``nilpotent'' by ''solvable''. For \(A=\{\operatorname{id}\}\), this was proved by \textit{J. G. Thompson} [Bull. Am. Math. Soc. 74, 383--437 (1968; Zbl 0159.30804)], and for \(A=\operatorname{Inn}(G)\), it is a result of \textit{S. Dolfi} et al. [J. Lond. Math. Soc., II. Ser. 85, No. 2, 269--281 (2012; Zbl 1246.20015)]. \end{itemize} The paper also contains results pertaining to \begin{itemize} \item complete vertices of \(\Gamma(G,A)\) (i.e., isolated vertices in the complement graph) -- see Theorems 3.2 and 3.5; \item isolated vertices of \(\Gamma(G,A)\) and the case where \(\Gamma(G,A)\) has no edges -- see Theorems 4.1 and 4.2; \item connectedness of \(\Gamma(G,A)\) when \(G\) is solvable -- see Theorem 5.2, which is a generalization of a result of \textit{C. Parker} [Bull. Lond. Math. Soc. 45, No. 4, 839--848 (2013; Zbl 1278.20017)] for the commuting graph of \(G\); \item the case where \(\Gamma(G,A)\) is triangle-free -- see Theorem 6.2. \end{itemize}
    0 references
    commuting graph
    0 references
    automorphism
    0 references
    automorphism group
    0 references
    group automorphism
    0 references
    solvable groups
    0 references
    nilpotent groups
    0 references
    graphs and groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references