English
Related papers

Related papers: Strongly Regular Graphs From Unions of Cyclotomic …

200 papers

Strongly regular Cayley graphs with Paley parameters over abelian groups of rank 2 were studied in [J.A Davis, Partial difference sets in p-groups, Arch.Math.63 (1994) 103-110; K.H Leung, S.L. Ma, Partial difference sets with Paley…

Combinatorics · Mathematics 2007-05-23 Yefim I. Leifman , Mikhail E. Muzychuk

For every integer d > 9, we construct infinite families {G_n}_n of d+1-regular graphs which have a large girth > log_d |G_n|, and for d large enough > 1,33 log_d |G_n|. These are Cayley graphs on PGL_2(q) for a special set of d+1 generators…

Combinatorics · Mathematics 2015-01-05 Xavier Dahan

In this paper we introduce a construction of directed strongly regular graphs from smaller ones using equitable partitions. Each equitable partition of a single DSRG satisfying several conditions leads to an infinite family of directed…

Combinatorics · Mathematics 2015-04-02 Štefan Gyürki

Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…

Combinatorics · Mathematics 2024-09-06 Bernat Bassols-Cornudella , Francesco Viganò

In this paper we unify several existing regularity conditions for graphs, including strong regularity, $k$-isoregularity, and the $t$-vertex condition. We develop an algebraic composition/decomposition theory of regularity conditions. Using…

Combinatorics · Mathematics 2020-02-17 Christian Pech

We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.

Combinatorics · Mathematics 2025-05-08 Masoumeh Koohestani , Doost Ali Mojdeh , Mohsen Ghasemi , Hassan Khodaiemehr

We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including…

Combinatorics · Mathematics 2019-01-31 Gary R. W. Greaves , Leonard H. Soicher

We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…

Combinatorics · Mathematics 2012-08-29 Koji Momihara

The \emph{critical} group of a finite connected graph is an abelian group defined by the Smith normal form of its Laplacian. Let $q$ be a power of a prime and $H$ be a multiplicative subgroup of $K=\mathbb{F}_{q}$. By $\mathrm{Cay}(K,H)$ we…

Combinatorics · Mathematics 2019-06-20 Venkata Raghu Tej Pantangi

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

Combinatorics · Mathematics 2024-09-04 Ján Mináč , Tung T. Nguyen , Nguyen Duy Tân

Let $q$ be an odd power of a prime $p$, and $S \subset \mathbb{F}_q^*$ such that $S=-S$ and $S/S \neq \mathbb{F}_q^*$. We show that the clique number of the Cayley graph $\operatorname{Cay}(\mathbb{F}_q^+,S)$ is at most…

Combinatorics · Mathematics 2025-11-26 Chi Hoi Yip

We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…

Combinatorics · Mathematics 2019-01-04 Agelos Georgakopoulos , Matthias Hamann

Using cyclotomy, we construct a new infinite family of Neumaier graphs that includes infinitely many strongly regular graphs. Notably, this family conjecturally contains infinitely many graphs with coherent rank $6$. Our construction also…

Combinatorics · Mathematics 2025-04-17 Gary R. W. Greaves , Zhao Kuang Tan

We construct a strongly regular graph with the parameters (65; 32; 15; 16). The idea is to search for an adjacency matrix that consists of circulant blocks. Equations with such matrices can be reduced to congruences with polynomials…

Combinatorics · Mathematics 2021-02-11 Oleg Gritsenko

We describe a general construction of strongly regular graphs from the collinearity graph of a finite classical polar spaces of rank at least $3$ over a finite field of order $q$. We show that these graphs are non-isomorphic to the…

Combinatorics · Mathematics 2017-08-01 Ferdinand Ihringer

In 2022, the second author found a prolific construction of strongly regular graphs, which is based on joining a coclique and a divisible design graph with certain parameters. The construction produces strongly regular graphs with the same…

Combinatorics · Mathematics 2023-06-16 Alexander L. Gavrilyuk , Vladislav V. Kabanov

Using a Cayley complex (generalizing the Cayley graph) and Clifford algebras, we are able to give, for a large class of finitely presented groups, a uniform construction of spectral triples with $D_{+}$ of index 1.

Operator Algebras · Mathematics 2016-11-10 Sebastien Palcoux

In this paper,we construct some directed strongly regular Cayley graphs on dihedral groups,these generalizes some earlier constructions.We also characterize some certain directed strongly regular Cayley graphs on dihedral groups…

Combinatorics · Mathematics 2019-09-20 Yiqin He , Bicheng Zhang , Rongquan Feng

An explicit construction of infinite sequences of strongly regular digraphs with parameter sets $((v+(2^{n+1}-4)t)2^{n-1}, k+(2^n-2)t, t, \lambda, t)$ is described. A computer program was used to find the initial digraphs. The remaining…

Combinatorics · Mathematics 2025-10-01 Viktor A. Byzov , Igor A. Pushkarev

In this paper, we give a necessary and sufficient condition for a subgroup to be a perfect code for finite groups. As an application, we determine all subgroup perfect codes of extraspecial 2-groups and finite groups whose Sylow 2-subgroup…

Combinatorics · Mathematics 2025-02-11 Li Jingjian , Li Binbin , Liu Xianglin