8 citations · 11 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2014★ 1 cited
Sporadic Examples of Directed Strongly Regular Graphs Obtained by Computer Algebra Experimentation (Extended version)
Štefan Gyürki, Mikhail Klin
We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the inve…
math.CO2010★ 2 cited
Automorphism groups of rational circulant graphs through the use of Schur rings
Mikhail Klin, István Kovács
The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques…
math.CO2010★ 8 cited
Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. II. Program Implementation of the Weisfeiler-Leman Algorithm
Luitpold Babel, Irina V. Chuvaeva, Mikhail Klin +1
The stabilization algorithm of Weisfeiler and Leman has as an input any square matrix A of order n and returns the minimal cellular (coherent) algebra W(A) which includes A. In cas…