Uniqueness of strongly regular graphs having minimal p-rank

17Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Peeters, R. (1995). Uniqueness of strongly regular graphs having minimal p-rank. Linear Algebra and Its Applications, 226228(C), 9–31. https://doi.org/10.1016/0024-3795(95)00184-S

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free