Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd (Q2341984)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd
scientific article

    Statements

    Quasirecognition by prime graph of \(^2D_n(3^\alpha)\) where \(n=4m+1\geq 21\) and \(\alpha\) is odd (English)
    0 references
    0 references
    0 references
    8 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    prime graph
    0 references
    simple group
    0 references
    recognition
    0 references
    quasirecognition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references