A graph r is locally Petersen if, for each point t of r, the graph induced by r on all points adjacent to t is isomorphic to the Petersen graph. We prove that there are exactly three isomorphismâ€¦ (More)

This problem was first suggested and discussed by Hale [6] and various special cases have been handled [ 5, 8, 121. As Hale observed, a partial linear space which is a projective plane with a pointâ€¦ (More)

A generic distance-regular graph is primitive of diameter at least two and valency at least three. We give a version of Derek Smithâ€™s famous theorem for reducing the classification ofâ€¦ (More)

The known families of binary sequences having asymptotic merit factor 6.0 are modifications to the families of Legendre sequences and Jacobi sequences. In this paper, we show that at N = pq, thereâ€¦ (More)

A distance-transitive graph G is one upon which the automorphism group acts transitively on ordered pairs of vertices at every fixed distance. Only connected graphs need to be considered. Those ofâ€¦ (More)

In this paper we begin the classification completed in [12] of all partial linear spaces n , graphs F, and groups G which satisfy one of the following: I. II = (0>, Â£Â£) is a connected partial linearâ€¦ (More)