On Distance-Regular Graphs with Smallest Eigenvalue at Least $-m$

Details On Distance-Regular Graphs with Smallest Eigenvalue at Least $-m$ On Distance-Regular Graphs with Smallest Eigenvalue at Least $-m$

2009-08-14

arxiv.org/abs/0908.2017v1

Mathematics

Combinatorics

Scientific paper

A non-complete geometric distance-regular graph is the point graph of a
partial geometry in which the set of lines is a set of Delsarte cliques. In
this paper, we prove that for fixed integer $m\geq 2$, there are only finitely
many non-geometric distance-regular graphs with smallest eigenvalue at least
$-m$, diameter at least three and intersection number $c_2 \geq 2$.

Affiliated with

Also associated with

No associations

Rating

On Distance-Regular Graphs with Smallest Eigenvalue at Least $-m$ 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 On Distance-Regular Graphs with Smallest Eigenvalue at Least $-m$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Distance-Regular Graphs with Smallest Eigenvalue at Least $-m$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-272247