Title

Automorphisms of strongly regular graphs with applications to partial difference sets

Authors

Stefaan DeWinter, Michigan Technological UniversityFollow
Ellen Kamischke, Ferris State University
Zeying Wang, Michigan Technological UniversityFollow

Document Type

Article

Publication Date

6-2016

Abstract

In this article we generalize a theorem of Benson (J Algebra 15:443–454, 1970) for generalized quadrangles to strongly regular graphs, deriving numerical restrictions on the number of fixed vertices and the number of vertices mapped to adjacent vertices under an automorphism. We then use this result to develop a few new techniques to study regular partial difference sets (PDS) in Abelian groups. Ma (Des Codes Cryptogr 4:221–261, 1994) provided a list of parameter sets of regular PDS with ƙ ≤ 100 in Abelian groups for which existence was known or had not been excluded. In particular there were 32 parameter sets for which existence was not known. Ma (J Stat Plan Inference 62:47–56, 1997) excluded 13 of these parameter sets. As an application of our results we here exclude the existence of a regular partial difference set for all but two of the undecided parameter sets from Ma’s list.

Publisher's Statement

© 2015 Springer Science+Business Media New York. Publisher's version of record: http://dx.doi.org/10.1007/s10623-015-0109-z

Publication Title

Designs, Codes and Cryptography

Recommended Citation

DeWinter, S., Kamischke, E., & Wang, Z. (2016). Automorphisms of strongly regular graphs with applications to partial difference sets. Designs, Codes and Cryptography, 79(3), 471-485. http://doi.org/10.1007/s10623-015-0109-z
Retrieved from: https://digitalcommons.mtu.edu/math-fp/2