Skip to main content
Log in

Automorphisms of strongly regular graphs with applications to partial difference sets

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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 \(k\le 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Benson C.T.: On the structure of generalized quadrangles. J. Algebra 15, 443–454 (1970).

  2. De Winter S.: Partial geometries pg\((s, t, 2)\) with an abelian singer group and a characterization of the van Lint-Schrijver partial geometry. J. Algebraic Comb. 24, 285–297 (2006).

  3. De Winter S., Thas K.: The automorphism group of Payne derived generalized quadrangles. Adv. Math. 214, 146–156 (2007).

  4. Fiedler F., Klin M.: A Strongly Regular Graph with the Parameters \((512,73,438,12,10)\) and Its Dual Graph. Preprint MATH-AL-7-1998, Technische Universität Dresden (1998).

  5. Godsil C., Royle G.: Algebraic Graph Theory. Springer, New York (2004).

  6. Horn R.A., Johnson C.R.: Matrix Analysis, 2nd ed. Cambridge University Press, Cambridge (2013).

  7. Jørgensen L.K., Klin M.: Switching of edges in strongly regular graphs. I. A family of partial difference sets on 100 vertices. Electron. J. Comb. 10, R17 (2003).

  8. Kohnert A.: Constructing two-weight codes with prescribed groups of automorphisms. Discret. Appl. Math. 155, 1451–1457 (2007).

  9. Ma S.L.: Partial difference sets. Discret. Math. 52, 75–89 (1984).

  10. Ma S.L.: A survey of partial difference sets. Des. Codes Cryptogr. 4, 221–261 (1994).

  11. Ma S.L.: Some necessary conditions on the parameters of partial difference sets. J. Stat. Plan. Inference 62, 47–56 (1997).

  12. Payne S.E., Thas J.A.: Finite generalized quadrangles. Pitman, Boston (1984).

  13. Temmermans B., Thas J.A., Van Maldeghem H.: On collineations and dualities of finite generalized polygons. Combinatorica 29, 569–594 (2009).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefaan De Winter.

Additional information

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Finite Geometries”.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

De Winter, S., Kamischke, E. & Wang, Z. Automorphisms of strongly regular graphs with applications to partial difference sets. Des. Codes Cryptogr. 79, 471–485 (2016). https://doi.org/10.1007/s10623-015-0109-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-015-0109-z

Keywords

Mathematics Subject Classification

Navigation