Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph (Q2005196)

From MaRDI portal
Revision as of 18:14, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
scientific article

    Statements

    Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2020
    0 references
    distance-regular graph
    0 references
    connectivity
    0 references
    subconstituent
    0 references
    \(Q\)-polynomial
    0 references
    primitive idempotent
    0 references
    balanced set condition
    0 references
    eigenvalue
    0 references
    strongly regular graph
    0 references
    association scheme
    0 references
    diameter
    0 references

    Identifiers

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