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
3 papers · 2 filters
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…