E. Bespalov

activity

20192023

most citedOn the non-existence of extended perfect codes and some perfect colorings

1 citations · 1 across the 1 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2023

$L_{\infty}$ norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs

E. A. Bespalov, I. Yu. Mogilnykh, K. V. Vorob'ev

We study nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and the Johnson graphs. For the first eigenvalue we obtain the minimums of $L_{\infty}$ -nor…

math.CO2020★ 1 cited

On the non-existence of extended perfect codes and some perfect colorings

Evgeny Bespalov

In this paper we obtain the necessary condition for the existence of perfect $k$ -colorings (equitable $k$ -partitions) in Hamming graphs $H (n, q)$ , where $q = 2, 3, 4$ and Doob graphs $D…

math.CO2019

Perfect 2-colorings of Hamming graphs

Evgeny A. Bespalov, Denis S. Krotov, Aleksandr A. Matiushev +2

We consider the problem of existence of perfect $2$ -colorings (equitable $2$ -partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs a…

L∞​ norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs

On the non-existence of extended perfect codes and some perfect colorings

Perfect 2-colorings of Hamming graphs

$L_{\infty}$ norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs