Related papers: Strongly regular graphs from weakly regular platea…
In this paper, we generalize the construction of strongly regular graphs in [Y. Tan et al., Strongly regular graphs associated with ternary bent functions, J. Combin.Theory Ser. A (2010), 117, 668-682] from ternary bent functions to $p$-ary…
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…
In this article a technique for constructing $p$-ary bent functions from near-bent functions is presented. Two classes of quadratic $p$-ary functions are shown to be near-bent. Applying the construction of bent functions to these classes of…
In this article a procedure to construct bent functions from $\F_{p^n}$ to $\F_p$ by merging plateaued functions which are bent on ($n-2$)-dimensional subspaces of $\F_{p^n}$ is presented. Taking advantage of such classes of plateaued…
In this paper we present a method for constructing directed strongly regular graphs with assumed action of an automorphism group. The application of this method leads to first examples of directed strongly regular graphs with parameters…
We obtain an explicit criterion for $p$-ary functions to produce association schemes in terms of their Walsh spectrum. Employing this characterization, we explicitly find a correlation between $p$-ary bent functions and association schemes;…
Our main result is a generalized Dillon-type theorem, giving graph-theoretic conditions which guarantee that a $p$-ary function in an even number of variables is bent, for $p$ a prime number greater than 2. The key condition is that the…
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…
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…
Duval, in "A Directed Graph Version of Strongly Regular Graphs" [{\it Journal of Combinatorial Theory}, Series A 47 (1988) 71 - 100], introduced the concept of directed strongly regular graphs. In this paper we construct several rich…
We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the investigation of non-commutative association schemes and Cayley…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
The characterization and construction of bent functions are challenging problems. The paper generalizes the constructions of Boolean bent functions by Mesnager \cite{M2014}, Xu et al. \cite{XCX2015} and $p$-ary bent functions by Xu et al.…
We give two constructions of strongly regular Cayley graphs on finite fields $\F_q$ by using union of cyclotomic classes and index 2 Gauss sums. In particular, we obtain twelve infinite families of strongly regular graphs with new…
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.
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.
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 give a new lifting construction of "hyperbolic" type of strongly regular Cayley graphs. Also we give new constructions of strongly regular Cayley graphs over the additive groups of finite fields based on partitions of…
In this article we construct a series of new infinite families of strongly regular graphs with the same parameters as the point-graphs of non-singular quadrics in PG(n,2).
In this paper, we construct directed strongly regular graphs with new parameters by using partial sum families with local rings. 16 families of new directed strongly regular graphs are obtained and the uniform partial sum families are…