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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Trivalent Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Sims Conjecture and Distance Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ARC TRANSITIVITY IN GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite distance transitive graphs of finite valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMITIVE AND IMPRIMITIVE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tetravalent Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-Transitive Graphs of Valency Four / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bipartite tetra0alent graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for orders of maximal subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über lokal s-reguläre Graphen / rank
 
Normal rank

Latest revision as of 17:16, 13 June 2024

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
    1982
    0 references
    distance-transitive
    0 references
    primitive permutation group
    0 references

    Identifiers