Search arXivSearch

arXiv · 2608.13089

Infinite series of Deza graphs with strongly regular children

Abstract

A graph $Γ$ is called a Deza graph with parameters $(n, k, b, a)$ if it has exactly $n$ vertices, is $k$-regular, and for any two distinct vertices $u$ and $v$, the number of common neighbors of $u$ and $v$ is either $a$ or $b$. The graphs $Δ_1$ and $Δ_2$, which have the same vertex set as $Γ$, and in which two vertices are adjacent if they have $a$ or $b$ common neighbours, respectively, are called the children of the Deza graph. If, for a Deza graph $Γ$, both $Δ_1$ and $Δ_2$ are strongly regular graphs, then $Γ$ is called a strongly Deza graph. In this work, we present a construction of an infinite family of strongly Deza graphs, for which the children $Δ_1$ and $Δ_2$ are strongly regular graphs with the same parameters as the graphs $NO^{\varepsilon \perp}_n(5)$ and $\overline{NO^{\varepsilon \perp}_n(5)}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mikhail P. Golubyatnikov. 2026-08-13. Infinite series of Deza graphs with strongly regular children. https://arxiv.org/abs/2608.13089

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

KEEP EXPLORING

Related papers

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

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