Konstantin V. Vorob'ev

According to our database, Konstantin V. Vorob'ev authored at least 9 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Some results on the Wiener index related to the Šoltés problem of graphs.

Andrey A. Dobrynin, Konstantin V. Vorob'ev

Discret. Appl. Math., February, 2024

2023

On completely regular codes with minimum eigenvalue in geometric graphs.

Ivan Yu. Mogilnykh, Konstantin V. Vorob'ev

Discret. Math., July, 2023

Constructions of binary codes with two distances.

Ivan N. Landjev, Assia Rousseva, Konstantin V. Vorob'ev

Discret. Math., June, 2023

Wiener index and graphs, almost half of whose vertices satisfy Šoltés property.

Margarita Akhmejanova, Konstantin Olmezov, Aleksei Volostnov, Ilya Vorobyev, Konstantin V. Vorob'ev, Yury Yarovikov

Discret. Appl. Math., 2023

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

E. A. Bespalov, Ivan Yu. Mogilnykh, Konstantin V. Vorob'ev

CoRR, 2023

2020

On reconstruction of eigenfunctions of Johnson graphs.

Konstantin V. Vorob'ev

Discret. Appl. Math., 2020

On Unbalanced Boolean Functions with Best Correlation Immunity.

Denis S. Krotov, Konstantin V. Vorob'ev

Electron. J. Comb., 2020

2019

Minimum supports of functions on the Hamming graphs with spectral constraints.

Alexandr Valyuzhenich, Konstantin V. Vorob'ev

Discret. Math., 2019

2018

Minimum supports of eigenfunctions of Johnson graphs.

Konstantin V. Vorob'ev, Ivan Yu. Mogilnykh, Alexandr Valyuzhenich

Discret. Math., 2018