Mikhail H. Klin

Affiliations:
  • Matej Bel University, Banska Bystrica, Slovakia
  • Ben Gurion University of the Negev, Department of Mathematics, Beer-Sheva, Israel


According to our database1, Mikhail H. Klin authored at least 25 papers between 1989 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
A non-Schurian coherent configuration on 14 points exists.
Des. Codes Cryptogr., 2017

Some new non-Schurian association schemes on 2p<sup>2</sup> points, p an odd prime, and related combinatorial structures.
Australas. J Comb., 2017

2014
Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation.
Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2013
Computer algebra investigation of known primitive triangle-free strongly regular graphs.
Proceedings of the 5th International Symposium on Symbolic Computation in Software Science, 2013

Enumeration of Schur Rings over the Group A 5.
Proceedings of the Computer Algebra in Scientific Computing - 15th International Workshop, 2013

2012
Links between two semisymmetric graphs on 112 vertices via association schemes.
J. Symb. Comput., 2012

Automorphism Groups of Rational Circulant Graphs.
Electron. J. Comb., 2012

2011
A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices.
Ars Math. Contemp., 2011

2010
Examples of computer experimentation in algebraic combinatorics.
Ars Math. Contemp., 2010

2009
Siamese Combinatorial Objects via Computer Algebra Experimentation.
Proceedings of the Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009

Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics.
Proceedings of the Algorithmic Algebraic Combinatorics and Gröbner Bases, 2009

2007
Association schemes on 28 points as mergings of a half-homogeneous coherent configuration.
Eur. J. Comb., 2007

2005
Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach.
Electron. Notes Discret. Math., 2005

2004
Algebraic methods for chromatic polynomials.
Eur. J. Comb., 2004

2003
A Root Graph that is Locally the Line Graph of the Peterson Graph.
Discret. Math., 2003

Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices.
Electron. J. Comb., 2003

2002
Primitivity of Permutation Groups, Coherent Algebras and Matrices.
J. Comb. Theory A, 2002

Small vertex-transitive directed strongly regular graphs.
Discret. Math., 2002

1999
Graphical t-designs via polynomial Kramer-Mesner matrices.
Discret. Math., 1999

The isomorphism problem for circulant graphs via Schur ring theory.
Proceedings of the Codes and Association Schemes, 1999

1998
On graphs with three eigenvalues.
Discret. Math., 1998

1996
on the Mathematical Model of Triangulanes.
Discret. Appl. Math., 1996

1991
For Computations with Coherent Configurations.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990
Galois correspondence between permutation groups and cellular rings (association schemes).
Graphs Comb., 1990

1989
Some new strongly regular graphs .
Comb., 1989


  Loading...