Biggs–Smith graph

Results: 1



#Item
1THEOREM 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

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