There are only finitely many distance-regular graphs of fixed valency greater than two

Details There are only finitely many distance-regular graphs of fixed valency greater than two There are only finitely many distance-regular graphs of fixed valency greater than two

2009-09-29

arxiv.org/abs/0909.5253v1

Mathematics

Combinatorics

51 pages

Scientific paper

In this paper we prove the Bannai-Ito conjecture, namely that there are only
finitely many distance-regular graphs of fixed valency greater than two.

Affiliated with

Also associated with

No associations

Rating

There are only finitely many distance-regular graphs of fixed valency greater than two does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with There are only finitely many distance-regular graphs of fixed valency greater than two, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and There are only finitely many distance-regular graphs of fixed valency greater than two will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-664507