We find we prove: lower kunds on eigenvalue multiplicities for highly symmetric graphs. In partictiar ## I.. If r is distance-regular with valency k and girth g (g 2 4). and A (A # *k) IS an eigenvalue of r, then the multiplicity of h is at least k(& - #e/41-1 if g=O or 1 ,'mod 4), 2( k -1)["4' i
✦ LIBER ✦
Multipliçities of an eigenvalue: Some observations
✍ Scribed by M. Thamban Nair
- Publisher
- Indian Academy of Sciences
- Year
- 2002
- Tongue
- English
- Weight
- 439 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0971-8044
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Eigenvalue multiplicities of highly symm
✍
Paul Terwilliger
📂
Article
📅
1982
🏛
Elsevier Science
🌐
English
⚖ 905 KB
Multiplicities of eigenvalues of some li
✍
A.J. Pryde; R.M. Phatarfod
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 541 KB
We consider the problem of dynamically reorganizing a linear list when the list is subject to a random number of requests during a unit time interval. Three different heuristics are considered in which the selected items are moved to the front of the list in random order. the same order and finally
Multiplicities of weights of some repres
✍
D. I. Panyushev
📂
Article
📅
1995
🏛
Springer US
🌐
English
⚖ 216 KB
Some uniqueness theorems with truncated
✍
Qiming Yan
📂
Article
📅
2008
🏛
Coastal and Estuarine Research Federation
🌐
English
⚖ 187 KB
Eigenvalue spectrum of some special matr
✍
George Avdelas
📂
Article
📅
1979
🏛
Elsevier Science
🌐
English
⚖ 433 KB
An example of an SL2-Hilbert scheme with
✍
Tanja Becker
📂
Article
📅
2011
🏛
SP Birkhäuser Verlag Boston
🌐
English
⚖ 635 KB