Let {top left corner} be a strongly regular graph with adjacency matrix A. Let I be the identity matrix and let p be a prime. We study the p-rank of the matrices A + cI for integral c and want to characterize among all strongly regular graphs with a given parameter set those for which a p-rank is minimal. © 1995.
CITATION STYLE
Peeters, R. (1995). Uniqueness of strongly regular graphs having minimal p-rank. Linear Algebra and Its Applications, 226–228(C), 9–31. https://doi.org/10.1016/0024-3795(95)00184-S
Mendeley helps you to discover research relevant for your work.