On Distance-Transitive Graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1985 English Publisher:WileyJournal:Bulletin of the London Mathematical Society, volume 17, pages 253-256 (issn: 0024-6093,

Copyright policy )

Authors: Weiss, Richard;

doi: 10.1112/blms/17.3.253

On Distance-Transitive Graphs

- Summary
- Subjects
- Metrics

Abstract

A result is proved which, together with a result of \textit{A. A. Ivanov} [Sov. Math., Dokl. 28, 149-152 (1983); translation from Dokl. Akad. Nauk SSSR 271, 789-792 (Russian) (1983; Zbl 0552.05034)], implies the theorem of Cameron (previously proved only using the classification of finite simple groups) that there are only finitely many finite distance- transitive graphs of given valency \(>2\).

Related Organizations

Tufts University
United States

Keywords

Generators, relations, and presentations of groups, finite distance-transitive graphs, Graphs and abstract algebra (groups, rings, fields, etc.)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average