Eigenpolytopes of distance regular graphs

Canadian Journal of Mathematics

Volumn 50, Issue 4, 1998, Pages 739-755

  Godsil, C D ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032379243     PISSN: 0008414X     EISSN: None     Source Type: Journal    
DOI: 10.4153/CJM-1998-040-8     Document Type: Article

References (18)

1. M. Balinski, On the graph structure of convex polyhedra in n-space. Pacific J. Math. 11(1961), 431-434.
2. A. Brøndsted, An Introduction to Convex Polytopes. Springer, New York, 1983.
3. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-Regular Graphs. Springer, Berlin, 1989.
4. P. Delsarte, An algebraic approach to the association schemes of coding theory. Philips Research Reports Supplements 10, 1973.
5. C. D. Godsil, Graphs, groups and polytopes. In: Combinatorial Mathematics, (eds. by D. A. Holton and Jennifer Seberry), Lecture Notes in Math. 686, Springer, Berlin, 1978, 157-164.
6. _, Bounding the diameter of distance regular graphs. Combinatorica 8(1988), 333-343.
7. _, Algebraic Combinatorics. Chapman and Hall, New York, 1993.
8. _, Equitable partitions. In: Combinatorics, Paul Erdos is Eighty, Vol. I. (eds. D. Miklós, V. T. Sós, T. Szonyi), János Bolyai Mathematical Society, Budapest, 1993, 173-192.
9. C. D. Godsil and W. J. Martin, Quotients of association schemes. J. Combin. Theory Ser. A 69(1995), 185-199.
10. E. W. Lambeck, Contributions to the Theory of Distance Regular Graphs. Ph. D. Thesis, Technical University Eindhoven, 1990.
11. C. Licata and D. L. Powers, A surprising property of some regular polytopes. Scientia 1(1988), 73-80.
12. A. Meyerowitz, Cycle-balanced partitions in distance-regular graphs. submitted.
13. A. Neumaier, Characterization of a class of distance-regular graphs. J. Reine Angew. Math. 357(1985), 182-192.
14. D. L. Powers, The Petersen polytopes. Technical Report, Clarkson University, 1986.
15. _, Eigenvectors of distance-regular graphs. SIAM J. Matrix Anal. Appl. 9(1988), 399-407.
16. P. Terwilliger, A new feasibility condition for distance-regular graphs. Discrete Math. 61(1986), 311-315.
17. _, Root systems and the Johnson and Hamming graphs. European J. Combin. 8(1987), 73-102.
18. R. Zhu, Distance-regular graphs with an eigenvalue of multiplicity four. J. Combin. Theory Ser. B 57(1993), 157-182.