Related papers: Construction of directed strongly regular graphs u…
In this paper, generalizing the result in \cite{GXY}, we construct strongly regular Cayley graphs by using union of cyclotomic classes of $\F_q$ and Gauss sums of index $w$, where $w\geq 2$ is even. In particular, we obtain three infinite…
We introduce the notion of q-analogs of strongly regular graphs and give several examples of such structures. We prove a necessary condition on the parameters, show the connection to designs over finite fields, and present a classification.
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…
In this paper, we give a construction of strongly regular Cayley graphs on the additive groups of finite fields based on three-valued Gauss periods. As consequences, we obtain two infinite families and one sporadic example of new strongly…
In \cite{M18}, the first author gave a construction of strongly regular Cayley graphs on the additive group of finite fields by using three-valued Gauss periods. In particular, together with the result in \cite{BLMX}, it was shown that…
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…
The paper provides the first constructions of strongly regular graphs and association schemes from weakly regular plateaued functions over finite fields of odd characteristic. We generalize the construction method of strongly regular graphs…
The paper shows the existence of a family of directed strongly regular graphs with parameters (22, 9, 6, 3, 4). The adjacency matrices of the found digraphs are composed of $3\times 3$ circulant blocks. The automorphism group of all the…
We construct a new family of strongly regular graphs with the same parameters as the strongly regular graphs $D_{5,5}(q)$. The construction can be seen as a variant of the construction of twisted Grassmann graphs by Van Dam and Koolen.
In this paper, we give a construction of strongly regular Cayley graphs and a construction of skew Hadamard difference sets. Both constructions are based on choosing cyclotomic classes in finite fields, and they generalize the constructions…
In this paper we construct all strongly regular graphs, with at most 600 vertices, admitting a transitive action of the orthogonal group $O^+(6,2)$ or $O^-(6,2)$. Consequently, we prove the existence of strongly regular graphs with…
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…
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…
We consider simple loopless finite undirected graphs. Such a graph is called strongly regular with parameter set (v,k,l,m), for short a srg(v,k,l,m), iff it has exactly v vertices, each of them has exactly k neighbours, and the number of…
A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several…
Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters…
Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of $q$-ary projective two-weight linear codes is presented, where $q$ is a power of 2. The parameters of…
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…
The first known families of cages arised from the incidence graphs of generalized polygons of order $q$, $q$ a prime power. In particular, $(q+1,6)$--cages have been obtained from the projective planes of order $q$. Morever, infinite…
In this paper, we construct directed strongly regular graphs and divisible design graphs with new parameters merging some basic relations of so-called Tatra associations schemes. We also study the above association schemes, their fusions…