Circles in (B, N)-groups

Distance-Regular Graphs

“…§A.8). Feasible parameter sets for strongly regular graphs with I' = 1 are for example (V,k,A) = (400,21,2), (3250,57,0), (3905,64,3 where [5] denotes a partial linear space of girth 5, and incidence is symmetrized containment. Now if ji = 1, then f(y) has lines of size X + 2 so that s oe;;; X + 1.…”

“…= (64,28,12,12) and (256,45,16,6), respectively), and these are not determined by their parameters; for example, the block graph of any transversal design TD [4;8] or TD [3;16] has the same parameters but is not isomorphic to the folded halved n-cube (n = 8, 10, respectively). = (64,28,12,12) and (256,45,16,6), respectively), and these are not determined by their parameters; for example, the block graph of any transversal design TD [4;8] or TD [3;16] has the same parameters but is not isomorphic to the folded halved n-cube (n = 8, 10, respectively).…”

“…Conversely, if PuP and PvP are distinct adjacent vertices in f with u, v E W, then by definition of double coset graph PvP ~ PuPrP, and by 10.5.1 (iii), (iv), (vii) we find PvP ~ PuXrP (since PVP =1= PuP) so that XUX and XvX are adjacent in;1. BICKEL [64] was perhaps the first to remark that f(G,P,r) is distancetransitive if and only if f(W,X,r) is distance-transitive. 2.…”