Sergey Goryainov

Orcid: 0000-0003-1016-6517

According to our database1, Sergey Goryainov authored at least 15 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Cliques in Paley graphs of square order and in Peisert graphs.
Des. Codes Cryptogr., May, 2026

Divisible design graphs from symplectic graphs over rings with a unique non-trivial ideal.
Des. Codes Cryptogr., March, 2026

Divisible design graphs with selfloops.
Discret. Math., 2026

2025
Divisible design graphs from the symplectic graph.
Des. Codes Cryptogr., May, 2025

Equitable 2-partitions of the Johnson graphs J(n,3).
Discret. Math., 2025

2024
Non-canonical maximum cliques without a design structure in the block graphs of 2-designs.
Des. Codes Cryptogr., November, 2024

Extremal Peisert-type graphs without the strict-EKR property.
J. Comb. Theory, Ser. A, 2024

2023
A general construction of strictly Neumaier graphs and a related switching.
Discret. Math., July, 2023

On eigenfunctions and maximal cliques of generalised Paley graphs of square order.
Finite Fields Their Appl., March, 2023

2022
On a correspondence between maximal cliques in Paley graphs of square order.
Discret. Math., 2022

The EKR-Module Property of Pseudo-Paley Graphs of Square Order.
Electron. J. Comb., 2022

2021
On the (signless Laplacian) spectral radius of minimally k-(edge)-connected graphs for small k.
Discret. Appl. Math., 2021

2019
On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs.
Eur. J. Comb., 2019

The Smallest Strictly Neumaier Graph and its Generalisations.
Electron. J. Comb., 2019

2018
On eigenfunctions and maximal cliques of Paley graphs of square order.
Finite Fields Their Appl., 2018


  Loading...