There are only finitely many finite distance-transitive graphs of given valency greater than two
type: Item
instance of: scholarly article
title: There are only finitely many finite distance-transitive graphs of given valency greater than two
zbMATH Open document ID: 0507.05037
DOI: 10.1007/BF02579277
author: Peter J. Cameron
published in: Combinatorica
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 20B25
zbMATH DE Number: 3799678
zbMATH Keywords: distance-transitive
zbMATH Keywords: primitive permutation group
MaRDI profile type: Publication
cites work: Q4770409
cites work: On Trivalent Graphs
cites work: On the Sims Conjecture and Distance Transitive Graphs
cites work: ARC TRANSITIVITY IN GRAPHS
cites work: Infinite distance transitive graphs of finite valency
cites work: PRIMITIVE AND IMPRIMITIVE GRAPHS
cites work: On Tetravalent Graphs
cites work: Distance-Transitive Graphs of Valency Four
cites work: On bipartite tetra0alent graphs
cites work: Bounds for orders of maximal subgroups
cites work: Über lokal s-reguläre Graphen
description: scientific article; zbMATH DE number 3799678