There are only finitely many finite distance-transitive graphs of given valency greater than two (Q1837204)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: There are only finitely many finite distance-transitive graphs of given valency greater than two |
scientific article; zbMATH DE number 3799678
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There are only finitely many finite distance-transitive graphs of given valency greater than two |
scientific article; zbMATH DE number 3799678 |
Statements
There are only finitely many finite distance-transitive graphs of given valency greater than two (English)
0 references
1982
0 references
distance-transitive
0 references
primitive permutation group
0 references
