arXiv subjects
Publications and source records attributed to Vladislav V. Kabanov.
A $k$-regular graph on $v$ vertices is a {\em divisible design graph} if there exist integers $λ_1,λ_2,m,n$ such that the vertex set can be partitioned into $m$ classes of size $n$ and any two different vertices from the same class have $λ_1$ common neighbours, and any two vertices from different classes have $λ_2$ common neighbours. In this paper, a new construction that produces divisible design graphs is provided.
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 parameters as the complement of the symplectic graph $\mathsf{Sp}(2d,q)$. In this paper, we determine the parameters of strongly regular graphs which admit a decomposition into a divisible design graph and a coclique attaining the Hoffman bound. In particular, it is shown that when the least eigenvalue of such a strongly regular graph is a prime power, its parameters coincide with those of the complement of $\mathsf{Sp}(2d,q)$. Furthermore, a generalization of the construction is discussed.
The symplectic graph Sp(2d, q) is the collinearity graph of the symplectic space of dimension 2d over a finite field of order q. A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1, lambda_2 ,m,n) if its vertex set can be partitioned into m classes of size n, such that any two different vertices from the same class have lambda_1 common neighbours, and any two vertices from different classes have lambda_2 common neighbours whenever it is not complete or edgeless. In this paper we propose a new construction of strongly regular graphs with the parameters of the complement of the symplectic graph using divisible design graphs.
A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1 ,lambda_2, m, n) if its vertex set can be partitioned into m classes of size n, such that any two different vertices from the same class have lambda_1 common neighbours, and any two vertices from different classes have lambda_2 common neighbours whenever it is not complete or edgeless. If m=1, then a divisible design graph is strongly regular with parameters (v, k, lambda_1, lambda_1). In this paper the Wallis-Fon-Der-Flaass construction of strongly regular graphs is modified to create new constructions of divisible design graphs. In some cases, these constructions lead to strongly regular graphs.
A Deza graph $G$ with parameters $(n,k,b,a)$ is a $k$-regular graph with $n$ vertices such that any two distinct vertices have $b$ or $a$ common neighbours. The children $G_A$ and $G_B$ of a Deza graph $G$ are defined on the vertex set of $G$ such that every two distinct vertices are adjacent in $G_A$ or $G_B$ if and only if they have $a$ or $b$ common neighbours, respectively. A strongly Deza graph is a Deza graph with strongly regular children. In this paper we give a spectral characterisation of strongly Deza graphs, show relationships between eigenvalues, and study strongly Deza graphs which are distance-regular.
A Deza graph G with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two distinct vertices have b or a common neighbours, where b >= a. The children G_A and G_B of a Deza graph G are defined on the vertex set of G such that every two distinct vertices are adjacent in G_A or G_B if and only if they have a or b common neighbours, respectively. In this paper we present a general approach to dual Seidel switching and investigate Deza graphs whose children are strongly regular graphs.
We present a construction that gives an infinite series of divisible design graphs which are Cayley graphs.
A Deza graph with parameters $(n,k,b,a)$ is a $k$-regular graph with $n$ vertices in which any two vertices have $a$ or $b$ ($a\leq b$) common neighbours. A Deza graph is strictly Deza if it has diameter $2$, and is not strongly regular. In an earlier paper, the two last authors et el. characterized the strictly Deza graphs with $b=k-1$ and $β> 1$, where $β$ is the number of vertices with $b$ common neighbours with a given vertex. Here we deal with the case $β=1$, thus we complete the characterization of strictly Deza graphs with $b=k-1$. It follows that all Deza graphs with $b=k-1$ and $β=1$ can be made from special strongly regular graphs, and we present several examples of such strongly regular graphs. A divisible design graph is a special Deza graph, and a Deza graph with $β=1$ is a divisible design graph. The present characterization reveals an error in a paper on divisible design graphs by the second author et al. We discuss the cause and the consequences of this mistake and give the required errata.
In this paper we find new maximal cliques of size $\frac{q+1}{2}$ or $\frac{q+3}{2}$, accordingly as $q\equiv 1(4)$ or $q\equiv 3(4)$, in Paley graphs of order $q^2$, where $q$ is an odd prime power. After that we use new cliques to define a family of eigenfunctions corresponding to both non-principal eigenvalues and having the cardinality of support $q+1$, which is the minimum by the weight-distribution bound.