Infinite classes of strongly regular graphs derived from $GL(n,F_2)$
Lu Lu, Qiongxiang Huang, Jiangxia Hou

TL;DR
This paper introduces eight infinite families of strongly regular graphs derived from orbit Cayley graphs over the elementary abelian 2-group, with six being new, and also provides their spectral properties.
Contribution
The paper constructs eight infinite families of strongly regular graphs from orbit Cayley graphs over Z_2^n, including six novel families, and characterizes their spectra.
Findings
Six new families of strongly regular graphs identified.
Spectral formulas for the orbit Cayley graphs derived.
Explicit construction methods provided.
Abstract
It is known that the automorphism group of the elementary abelian -group is isomorphic to the general linear group of degree over . Let be the collection of permutation matrices of order . It is clear that . In virtue of this, we consider the Cayley graph , where is the union of some orbits under the action of . We call such graphs the orbit Cayley graphs over . In this paper, we give eight infinite families of strongly regular graphs among orbit Cayley graphs over , in which six families are new as we know. By the way, we formulate the spectra of orbit Cayley graphs as well.
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
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
