THEOREM OF THE DAY Theorem (Cameron, 1982) For any integer k > 2 there exist only finitely many distance-transitive kregular graphs. The Biggs-Smith graph is the largest distance-transitive graph that is 3-regular (every - Distance-transitive graph - Document - PDFSEARCH.IO

First Page	Meta Content
	THEOREM OF THE DAY Theorem (Cameron, 1982) For any integer k > 2 there exist only finitely many distance-transitive kregular graphs. The Biggs-Smith graph is the largest distance-transitive graph that is 3-regular (every Add to Reading List Document Date: 2014-02-07 05:07:16 Open Document File Size: 238,28 KB Share Result on Facebook Company Cambridge University Press / / IndustryTerm Web link / / Organization Cambridge University / / Person Robin Whitty / / Technology pdf / / URL www.theoremoftheday.org / www.math.carleton.ca / / SocialTag Biggs–Smith graph Graph Symmetric graph Graph automorphism Graph theory Algebraic graph theory Distance-transitive graph

THEOREM OF THE DAY Theorem (Cameron, 1982) For any integer k > 2 there exist only finitely many distance-transitive kregular graphs. The Biggs-Smith graph is the largest distance-transitive graph that is 3-regular (everyAdd to Reading List