Biggs–Smith graph

#	Item
1	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 Source URL: www.theoremoftheday.org Language: English - Date: 2014-02-07 05:07:16 Biggs–Smith graph Graph Symmetric graph Graph automorphism Graph theory Algebraic graph theory Distance-transitive graph