EJC
2006
13 years 11 months ago
2006
In this paper we study the sequence (ci)0id for a distance-regular graph. In particular we show that if d 2j and cj = c > 1 then c2j > c holds. Using this we give improveme...
EJC
2010
13 years 11 months ago
2010
A Shilla distance-regular graph (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 divide...