Construction of directed strongly regular graphs using finite incidence structures
O. Olmez, S. Y. Song

TL;DR
This paper introduces new methods to construct infinite families of directed strongly regular graphs using finite incidence structures, expanding known parameter sets and providing explicit examples with feasible parameters.
Contribution
The paper presents novel constructions of directed strongly regular graphs from finite incidence structures, including explicit parameter sets and a review of feasible parameters.
Findings
Constructed new infinite families of directed strongly regular graphs.
Provided explicit examples with feasible parameters.
Demonstrated how methods can generate other families.
Abstract
We use finite incident structures to construct new infinite families of directed strongly regular graphs with parameters \[(l(q-1)q^l,\ l(q-1)q^{l-1},\ (lq-l+1)q^{l-2},\ (l-1)(q-1)q^{l-2},\ (lq-l+1)q^{l-2})\] for integers and (), and \[(lq^2(q-1),\ lq(q-1),\ lq-l+1,\ (l-1)(q-1),\ lq-l+1)\] for all prime powers and . The new graphs given by these constructions have parameters , , , , and listed as feasible parameters on "Parameters of directed strongly regular graphs," at by S. Hobart and A. E. Brouwer. We review these constructions and show how our methods may be used to construct other infinite families of directed strongly regular graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography
