Shilla distance-regular graphs

Details Shilla distance-regular graphs Shilla distance-regular graphs

2009-02-23

arxiv.org/abs/0902.3860v1

Mathematics

Combinatorics

14 pages

Scientific paper

A Shilla distance-regular graph G (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divides k for a Shilla distance-regular graph G, and for G we define b=b(G):=k/a3. In this paper we will show that there are finitely many Shilla distance-regular graphs G with fixed b(G)>=2. Also, we will classify Shilla distance-regular graphs with b(G)=2 and b(G)=3. Furthermore, we will give a new existence condition for distance-regular graphs, in general.

Affiliated with

Also associated with

No associations

Rating

Shilla distance-regular graphs 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 Shilla distance-regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Shilla distance-regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-584228