Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648013 | Discrete Mathematics | 2012 | 8 Pages |
Abstract
We consider a bipartite distance-regular graph Î with vertex set X, diameter Dâ¥4, valency kâ¥3, and eigenvalues θ0>θ1>â¯>θD. Let CX denote the vector space over C consisting of column vectors with rows indexed by X and entries in C. For zâX, let zË denote the vector in CX with a 1 in the zth row and 0 in all other rows. Fix x,yâX with â(x,y)=2, where â denotes the path-length distance. For 0â¤i,jâ¤D, we define wij=âzË, where the sum is over all vertices z such that â(x,z)=i and â(y,z)=j. Define a parameter Î in terms of the intersection numbers by Î=(b1â1)(c3â1)â(c2â1)p222. In [M. MacLean, An inequality involving two eigenvalues of a bipartite distance-regular graph, Discrete Math. 225 (2000) 193-216], we defined what it means for Î to be taut. We show Î is taut if and only if Îâ 0 and the vectors ExË,EyË,Ew11,Ew22 are linearly dependent for Eâ{E1,Ed}, where d=âD/2â and Ei is the primitive idempotent associated with θi.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mark S. MacLean,