Ten Exceptional Geometries from Trivalent Distance Regular Graphs
โ Scribed by Hendrik Van Maldeghem
- Book ID
- 105748853
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 166 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0218-0006
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let ฮ be a regular graph with n vertices, diameter D, and d + 1 In a previous paper, the authors showed that if P (ฮป) > n -1, then D โค d -1, where P is the polynomial of degree d-1 which takes alternating values ยฑ1 at ฮป 1 , . . . , ฮป d . The graphs satisfying P (ฮป) = n -1, called boundary graphs, h
In we have studied the semibiplanes e m,h = A f (S e m,h ) obtained as affine expansions of the d-dimensional dual hyperovals of Yoshiara . We continue that investigation here, but from a graph theoretic point of view. Denoting by e m,h the incidence graph of (the point-block system of) e m,h , we
The local adjacency polynomials can be thought of as a generalization, for all graphs, of (the sums of ) the distance polynomials of distance-regular graphs. The term ``local'' here means that we ``see'' the graph from a given vertex, and it is the price we must pay for speaking of a kind of distanc