Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6416662 | Linear Algebra and its Applications | 2013 | 10 Pages |
Abstract
A non-complete distance-regular graph Î is called geometric if there exists a set C of Delsarte cliques such that each edge of Î lies in a unique clique in C. In this paper we determine the non-complete distance-regular graphs satisfying 3,83(a1+1)
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
S. Bang,