The following pages link to Sergey Viktorovich Goryainov (Q2058351):
Displaying 27 items.
- On the vertex connectivity of Deza graphs (Q470997) (← links)
- Deza graphs on 14, 15 and 16 vertices (Q890859) (← links)
- Cayley-Deza graphs with fewer than 60 vertices (Q892000) (← links)
- On isomorphism between distance-regular graphs (Q892001) (← links)
- (Q1637207) (redirect page) (← links)
- On eigenfunctions and maximal cliques of Paley graphs of square order (Q1637210) (← links)
- On Deza graphs with disconnected second neighborhood of a vertex (Q1675321) (← links)
- Enumeration of strictly Deza graphs with at most 21 vertices (Q2058354) (← links)
- The EKR-module property of pseudo-Paley graphs of square order (Q2112567) (← links)
- On a correspondence between maximal cliques in Paley graphs of square order (Q2124644) (← links)
- Integral graphs obtained by dual Seidel switching (Q2197220) (← links)
- On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) (Q2235269) (← links)
- \(PI\)-eigenfunctions of the Star graphs (Q2282770) (← links)
- On vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs (Q2311360) (← links)
- The smallest strictly Neumaier graph and its generalisations (Q2420557) (← links)
- On eigenfunctions and maximal cliques of generalised Paley graphs of square order (Q2689353) (← links)
- On Perfect 2‐Colorings of Johnson Graphs <i>J</i>(<i>v</i>, 3) (Q4929281) (← links)
- Equitable partitions of Latin‐square graphs (Q5225117) (← links)
- Deza graphs with parameters and (Q5225119) (← links)
- On Deza graphs with triangular and lattice graph complements as parameters (Q5263807) (← links)
- The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899) (← links)
- A general construction of strictly Neumaier graphs and a related switching (Q6046159) (← links)
- Extremal Peisert-type graphs without the strict-EKR property (Q6510375) (← links)
- On eigenfunctions of the block graphs of geometric Steiner systems (Q6513669) (← links)
- Divisible design graphs from the symplectic graph (Q6530666) (← links)
- Extremal Peisert-type graphs without the strict-EKR property (Q6543049) (← links)
- Non-canonical maximum cliques without a design structure in the block graphs of 2-designs (Q6632054) (← links)
