There are only finitely many finite distance-transitive graphs of given valency greater than two (Q1837204)

From MaRDI portal
Revision as of 06:59, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
There are only finitely many finite distance-transitive graphs of given valency greater than two
scientific article

    Statements

    There are only finitely many finite distance-transitive graphs of given valency greater than two (English)
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    distance-transitive
    0 references
    primitive permutation group
    0 references