Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1809.06084

Infinite classes of strongly regular graphs derived from $GL(n,F_2)$

Lu Lu·Qiongxiang Huang·Jiangxia Hou
View original source ↗Read source document ↗Export metadata ↓

Abstract

It is known that the automorphism group of the elementary abelian $2$-group $Z_2^n$ is isomorphic to the general linear group $GL(n,F_2)$ of degree $n$ over $F_2$. Let $W$ be the collection of permutation matrices of order $n$. It is clear that $W\le GL(n,F_2)$. In virtue of this, we consider the Cayley graph $Cay(Z_2^n,S)$, where $S$ is the union of some orbits under the action of $W$. We call such graphs the orbit Cayley graphs over $Z_2^n$. In this paper, we give eight infinite families of strongly regular graphs among orbit Cayley graphs over $Z_2^n$, in which six families are new as we know. By the way, we formulate the spectra of orbit Cayley graphs as well.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lu Lu, Qiongxiang Huang, Jiangxia Hou. 2018-09-17. Infinite classes of strongly regular graphs derived from $GL(n,F_2)$. https://arxiv.org/abs/1809.06084

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗