On the Diameter of a<i>p</i>-Regular Conjugacy Class Graph of Finite Groups II (Q4420220): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs related to conjugacy classes of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DIAMETER OF A <i>p</i>-REGULAR CONJUGACY CLASS GRAPH OF FINITE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Graph Related to Conjugacy Classes of Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diameter of a Graph Related to Conjugacy Classes of Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical conditions on the length of the conjugacy classes of a finite group / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter of a graph related to \(p\)-regular conjugacy classes of finite groups / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1081/agb-120022799 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4237315050 / rank
 
Normal rank

Latest revision as of 11:30, 30 July 2024

scientific article; zbMATH DE number 1964733
Language Label Description Also known as
English
On the Diameter of a<i>p</i>-Regular Conjugacy Class Graph of Finite Groups II
scientific article; zbMATH DE number 1964733

    Statements

    On the Diameter of a<i>p</i>-Regular Conjugacy Class Graph of Finite Groups II (English)
    0 references
    0 references
    14 August 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    conjugacy classes
    0 references
    finite groups
    0 references
    \(p\)-soluble groups
    0 references
    numbers of connected components
    0 references
    complete graphs
    0 references
    \(p\)-regular elements
    0 references
    0 references