Titlebook: Distance-Regular Graphs; Andries E. Brouwer,Arjeh M. Cohen,Arnold Neumaier Book 1989 Springer-Verlag Berlin Heidelberg 1989 Arithmetic.Lie

琐事

originality

https://doi.org/10.1007/978-3-642-37747-1 each category the parameter sets are ordered by . (not .). We only list intersectiòn arrays that pass all feasibility criteria known to us. We do not give any information on the polygons (e.g., these have many .- and .-polynomial structures).

逃避系列单词

Graphs Related to Classical Geometries,aphs are distance-regular. In the last three sections we construct several infinite families of antipodal covers of complete graphs (starting from affine instead of projective points), and an infinite family of partial geometries yielding bipartite distance-regular graphs of diameter 4 (starting from complete arcs in a projective plane).

LIMN

辩论

entrance

BOAST

,Downsizing: Bill Clinton’s First Term,pter 8) and codes in graphs (Chapter 11). Multiplicity formulas (2.2.2) and bounds (2.3.3) as well as the Krein conditions (2.3.2) developed here in general context will recur for distance-regular graphs in Chapter 4.

宽容

吹牛需要艺术

减弱不好

W. E. Staas Jr.,H. M. Cioschi,B. Jacobs partition of . into cosets of ., we take an arbitrary partition Π of Γ, Now there is an obvious concept of quotient graph Γ / Π generalizing that of coset graph, and Theorem 11.1.6 gives a sufficient condition for this quotient graph to be distance-regular. Section 11.1 is the outgrowth of earlier discussions with A.R. Calderbank.