English
Related papers

Related papers: Strongly Regular Graphs Constructed from $p$-ary B…

200 papers

It is well known that 3--regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3--regular graphs without reducing the girth, thereby proving that such graphs with…

Combinatorics · Mathematics 2019-02-28 Michael Haythorpe

Strongly regular graphs are highly symmetrical and can be described fully with just a few parameters yet the existence of many of them is still under the question. Due to this uncertainty, it is of immense interest to study their structure,…

Combinatorics · Mathematics 2025-11-05 Reimbay Reimbayev

In this paper we consider the question of when a strongly regular graph with parameters $((s+1)(st+1),s(t+1),s-1,t+1)$ can exist. These parameters arise when the graph is derived from a generalized quadrangle, but there are other examples…

Combinatorics · Mathematics 2019-09-18 Ivan Guo , Jack H. Koolen , Greg Markowsky , Jongyook Park

In this paper, several classes of three-weight ternary linear codes from non-weakly regular dual-bent functions are constructed based on a generic construction method. Instead of the whole space, we use the subspaces $B_+(f)$ or $B_-(f)$…

Information Theory · Computer Science 2022-01-19 Rumi Melih Pelen

Strongly regular graphs (SRGs) are highly symmetric combinatorial objects, with connections to many areas of mathematics including finite fields, finite geometries, and number theory. One can construct an SRG via the Cayley Graph of a…

Combinatorics · Mathematics 2024-08-15 Andrew C. Brady

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…

Combinatorics · Mathematics 2018-05-10 Thomas Jenrich

The real monomial representations of Clifford algebras give rise to two sequences of bent functions. For each of these sequences, the corresponding Cayley graphs are strongly regular graphs, and the corresponding sequences of strongly…

Combinatorics · Mathematics 2019-04-22 Paul Leopardi

Strongly walk regular graphs (SWRGs or $s$-SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~$s$. They can be constructed as coset graphs of the duals of…

Combinatorics · Mathematics 2025-10-02 Michael Kiermaier , Sascha Kurz , Patrick Solé , Michael Stoll , Alfred Wassermann

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…

Combinatorics · Mathematics 2026-01-19 Mikhail Muzychuk , Grigory Ryabov

In 1988, Duval introduced the concept of directed strongly regular graphs, which can be viewed as a directed graph version of strongly regular graphs. Such directed graphs have similar structural and algebraic properties to strongly regular…

Combinatorics · Mathematics 2022-11-02 Xueyi Huang , Lu Lu , Jongyook Park

The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…

Combinatorics · Mathematics 2025-04-14 Jared DeLeo

In this paper, we give a complete description of strongly regular graphs with parameters ((n^2+3n-1)^2,n^2(n+3),1,n(n+1)). All possible such graphs are: the lattice graph $L_{3,3}$ with parameters (9,4,1,2), the Brouwer-Haemers graph with…

Combinatorics · Mathematics 2012-02-06 Andriy V. Bondarenko , Danylo V. Radchenko

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.

Combinatorics · Mathematics 2022-12-06 Michael Braun , Dean Crnković , Maarten De Boeck , Vedrana Mikulić Crnković , Andrea Švob

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

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

Combinatorics · Mathematics 2014-11-14 S. De Winter , E. Kamischke , Z. Wang

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

Logic · Mathematics 2016-02-25 Artem Chernikov , Sergei Starchenko

We construct strongly walk-regular graphs as coset graphs of the duals of codes with three non-zero homogeneous weights over $\mathbb{Z}_{p^m},$ for $p$ a prime, and more generally over chain rings of depth $m$, and with a residue field of…

Combinatorics · Mathematics 2019-12-10 Michael Kiermaier , Sascha Kurz , Minjia Shi , Patrick Solé

In this paper, we study the net-regular strongly regular signed graphs with degree 6 and determine all connected 6-regular and net-regular strongly regular signed graphs. There are three, six and four 6-regular strongly regular signed…

Combinatorics · Mathematics 2025-08-04 Qian Yu , Yaoping Hou

In this paper, we further investigate properties of generalized bent Boolean functions from $\Z_{p}^n$ to $\Z_{p^k}$, where $p$ is an odd prime and $k$ is a positive integer. For various kinds of representations, sufficient and necessary…

Number Theory · Mathematics 2016-06-09 Libo Wang , Baofeng Wu , Zhuojun Liu

In this paper, a new construction of quaternary bent functions from quaternary quadratic forms over Galois rings of characteristic 4 is proposed. Based on this construction, several new classes of quaternary bent functions are obtained, and…

Discrete Mathematics · Computer Science 2013-09-03 Baofeng Wu , Dongdai Lin