On automorphisms of strongly regular graphs with parameters (243,66,9,21).
On automorphisms of strongly regular graphs with and . II.
On -walk-regular graphs.
On the common-neighborhood energy of a graph
On the Nilpotent representations of GLn (O).
On the structure of multipliers of .
On the vertex connectivity of a relation in an association scheme.
Osculating paths and oscillating tableaux.
Pseudodual grids and extensions of generalized quadrangles.
Recognizing circulant graphs of prime order in polynomial time.
Separability number and Schurity number of coherent configurations.
Some applications of the proper and adjacency polynomials in the theory of graph spectra.
Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes.
Standard character condition for table algebras.
Strongly regular graphs: Values of and for which there are only finitely many feasible .
Strongly regular locally -graphs.
Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices.
The difference matrices of the classes of a Sharma-Kaushik partition
Sharma-Kaushik partitions have been used to define distances between vectors with -coordinates. In this paper, “difference matrices” for the partitioning classes have been introduced and investigated. It has been shown that the difference matrices are circulant and that the entries of a product of matrices is an extended intersection number of a distance scheme. The sum of the entries of each row or columns of the product matrix has been obtained. The algebra of matrices generated by the difference...
The matching polynomial of a distance-regular graph.
The maximum size of a partial spread in is .