81 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Kazan Federal UniversityRU57 papers
- Ural Federal UniversityRU38 papers
- Ural Branch of the Russian Academy of SciencesRU23 papers
- Chelyabinsk State UniversityRU19 papers
- Sobolev Institute of MathematicsRU12 papers
- Institute of Problems of Mechanical EngineeringRU11 papers
- National Research Nuclear University MEPhIRU11 papers
- V. N. Karazin Kharkiv National UniversityUA11 papers
- Herzen UniversityRU10 papers
- Institute of PhysicsPL9 papers
- Novosibirsk State UniversityRU8 papers
- Russian Academy of SciencesRU7 papers
19 papers · 1 filter
Symplectic geometry of electrical networks
Boris Bychkov, Vassily Gorbounov, Lazar Guterman +1
In this paper we relate a well-known in symplectic geometry compactification of the space of symmetric bilinear forms considered as a chart of the Lagrangian Grassmannian to the sp…
Classification of divisible design graphs with at most 39 vertices
Dmitry Panasenko, Leonid Shalaginov
A -regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into classes of size , such that two distinct vertices from the s…
Enumeration of strictly Deza graphs with at most 21 vertices
Sergey Goryainov, Dmitry Panasenko, Leonid Shalaginov
A Deza graph with parameters is a -regular graph with vertices such that any two distinct vertices have or common neighbours, where . A Deza…
Spectra of strongly Deza graphs
Saieed Akbari, Willem H. Haemers, Mohammad Ali Hosseinzadeh +3
A Deza graph with parameters is a -regular graph with vertices such that any two distinct vertices have or common neighbours. The children and…
On the prime spectrum of an automorphism group of an -graph
Ludmila Tsiovkina
This paper is devoted to the problem of classification of -graphs. There is a unique -graph with , namely, the distance-transitive Soic…
Generalised dual Seidel switching and Deza graphs with strongly regular children
Vladislav V. Kabanov, Elena V. Konstantinova, Leonid Shalaginov
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…
On divisible design Cayley graphs
Vladislav V. Kabanov, Leonid Shalaginov
We present a construction that gives an infinite series of divisible design graphs which are Cayley graphs.
Integral graphs obtained by dual Seidel switching
Sergey Goryainov, Elena V. Konstantinova, Honghai Li +1
Dual Seidel switching is a graph operation introduced by W.~Haemers in 1984. This operation can change the graph, however it does not change its bipartite double, and because of th…
Deza graphs with parameters (v,k,k-2,a)
Vladislav Kabanov, Leonid Shalaginov
A Deza graph with parameters is a -regular graph on vertices in which the number of common neighbors of two distinct vertices takes two values or ($a\leq…
On a characterization of the Grassmann graphs
Alexander L. Gavrilyuk, Jack H. Koolen
In 1995, Metsch showed that the Grassmann graph of diameter is characterized by its intersection numbers with the following possible exceptions: (-) or…
Cameron-Liebler line classes in
Alexander L. Gavrilyuk, Ilia Matkin
We complete a classification of Cameron-Liebler line classes in , and show in a uniform way all non-existence results for those in , .
-eigenfunctions of the Star graphs
Sergey Goryainov, Vladislav Kabanov, Elena Konstantinova +2
We consider the symmetric group , generated by the set of transpositions , and the Cayley graph $S_n=Cay(\math…
Vertex connectivity of Deza graphs with parameters of complements to Seidel graphs
Sergey V. Goryainov, Dmitry I. Panasenko
In this paper we find the vertex connectivity of Deza graphs with parameters of the complements to Seidel graphs. In particular, we present an infinite family of strictly Deza grap…
Equitable partitions of Latin-square graphs
R. A. Bailey, Peter J. Cameron, Alexander L. Gavrilyuk +1
We study equitable partitions of Latin-square graphs, and give a complete classification of those whose quotient matrix does not have an eigenvalue .
On eigenfunctions and maximal cliques of Paley graphs of square order
Sergey Goryainov, Vladislav V. Kabanov, Leonid Shalaginov +1
In this paper we find new maximal cliques of size or , accordingly as or , in Paley graphs of order , where is…
On strictly Deza graphs with parameters (n,k,k-1,a)
V. V. Kabanov, N. V. Maslova, L. V. Shalaginov
A nonempty -regular graph on vertices is called a Deza graph if there exist constants and such that any pair of distinct vertices of has precise…
Distance-regular graphs without 4-claws
Sejeong Bang, Alexander Gavrilyuk, Jack Koolen
We determine the distance-regular graphs with diameter at least and but without induced -subgraphs.
Derivation of Cameron-Liebler line classes
Alexander L. Gavrilyuk, Ilia Matkin, Tim Penttila
We construct a new infinite family of Cameron-Liebler line classes in with parameter for all odd .
Biregular graphs with three eigenvalues
Xi-Ming Cheng, Alexander L. Gavrilyuk, Gary R. W. Greaves +1
We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include construct…