M. Klin

发表

Analytical Enumeration of Circulant Graphs with Prime-Squared Number of Vertices

M. Klin, V. Liskovets, R. Pöschel, 1996 .

Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. II. Program Implementation of the Weisfeiler-Leman Algorithm

M. Klin, D. Pasechnik, Luitpold Babel, 2010, 1002.1921.

Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. III. Graph Invariants and

M. Klin, G. Tinhofer, 1999 .

From the principle of bijection to the isomorphism of structures: an analysis of some teaching paradigms in discrete mathematics

M. Klin, G. Ebert, C. Ebert, 2004 .

Cellular Rings and Groups of Automorphisms of Graphs

M. Klin, I. Faradzev, M. E. Muzichuk, 1994 .

Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. I. Permutation Groups and

M. Klin, G. Tinhofer, Ch. Rucker, 1995 .

Application of the Representation Theory of Symmetric Groups for the Computation of Chromatic Polynomials of Graphs

M. Klin, C. Pech, Christian Pech, 2008 .

Group Theory Permutation Groups

P. Cameron, W. Kantor, M. Klin, 2017 .

A combinatorial approach to transitive extensions of generously unitransitive permutation groups

A. Woldar, M. Klin, D. Mesner, 2010 .

Graphical t -designs via polynomial Kramer-Mesner matrices

Reinhard Laue, Alfred Wassermann, Anton Betten, 1999 .

Links between two semisymmetric graphs on 112 vertices through the lens of association schemes

M. Klin, J. Lauri, Matan Ziv-Av, 2011 .

Proper Jordan schemes exist. First examples, computer search, patterns of reasoning. An essay

M. Klin, M. Muzychuk, Sven Reichard, 2019, 1911.06160.

Automorphism groups of rational circulant graphs through the use of Schur rings

M. Klin, I. Kov'acs, 2010, 1008.0751.

Construction of infinite families of non-Schurian association schemes of order $2p^2$, $p$ an odd prime, based on biaffine planes and Heisenberg groups: research report and beyond

M. Klin, vStefan Gyurki, 2015, 1507.03783.

The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures

M. Klin, Matan Ziv-Av, Stefan Gyürki, 2016 .

From Schur Rings to Constructive and Analytical Enumeration of Circulant Graphs with Prime-Cubed Number of Vertices

M. Klin, V. Liskovets, J. Lauri, 2016 .

Methods and Algorithms . II . Program Implementation of the Weisfeiler-Leman Algorithm arXiV

M. Klin, D. Pasechnik, I. V. Chuvaeva, 2010 .

On the existence of self-complementary and non-self-complementary strongly regular graphs with Paley parameters

A. Woldar, M. Klin, Nimrod Kriger, 2016 .

A non-Schurian coherent configuration on 14 points exists

M. Klin, Matan Ziv-Av, 2016, Designs, Codes and Cryptography.

Jordan schemes

M. Klin, M. Muzychuk, Sven Reichard, 2019, Israel Journal of Mathematics.

Siamese objects, and their relation to color graphs, association schemes and Steiner designs

A. Woldar, M. Klin, Sven Reichard, 2006 .

Algebraic methods for chromatic polynomials

Mikhail H. Klin, Norman L. Biggs, P. Reinfeld, 2004, Eur. J. Comb..

on the Mathematical Model of Triangulanes

Mikhail E. Muzychuk, Mikhail H. Klin, Nikolai S. Zefirov, 1996, Discret. Appl. Math..

Graphical t-designs via polynomial Kramer-Mesner matrices

Mikhail H. Klin, Reinhard Laue, Alfred Wassermann, 1999, Discret. Math..

On graphs with three eigenvalues

Mikhail E. Muzychuk, Mikhail H. Klin, M. Klin, 1998, Discret. Math..

The König problem, the isomorphism problem for cyclic graphs and the characterization of Schur rings

M. Klin, M. H. Klin, R. Pösdiel, 1978 .

Examples of computer experimentation in algebraic combinatorics

Mikhail H. Klin, Andrew J. Woldar, Christian Pech, 2010, Ars Math. Contemp..

Higmanian rank-5 association schemes on 40 points

Mikhail Klin, Mikhail Muzychuk, Matan Ziv-Av, 2009 .

Association schemes on 28 points as mergings of a half-homogeneous coherent configuration

Mikhail E. Muzychuk, Mikhail H. Klin, Andrew J. Woldar, 2007, Eur. J. Comb..

Small vertex-transitive directed strongly regular graphs

Mikhail E. Muzychuk, Mikhail H. Klin, Frank Fiedler, 2002, Discret. Math..

Computer algebra experimentation with Higmanian rank 5 association schemes on 40 vertices and related combinatorial objects

M. Klin, M. Muzychuk, Matan Ziv-Av, 2012 .

Transitive Permutation Groups Without Semiregular Subgroups

Peter J. Cameron, William M. Kantor, Dragan Marušič, 2002 .

Some new strongly regular graphs

Mikhail H. Klin, Andries E. Brouwer, A. V. Ivanov, 1989, Comb..

For computations with coherent configurations

Mikhail H. Klin, I. A. Faradzev, M. Klin, 1991, ISSAC '91.

The isomorphism problem for circulant graphs via Schur ring theory

M. Klin, R. Pöschel, M. Muzychuk, 1999, Codes and Association Schemes.

Amorphic Cellular Rings

A. V. Ivanov, Mikhail Klin, Ja. Ju. Gol’fand, 1994 .

Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation

Mikhail H. Klin, Stefan Gyürki, M. Klin, 2014, CASC.

A computer approach to the enumeration of block designs which are invariant with respect to a prescribed permutation group

Anton Betten, Mikhail Klin, Christian Pech, 1997 .

Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices

Mikhail H. Klin, Leif K. Jørgensen, M. Klin, 2003, Electron. J. Comb..

Siamese Combinatorial Objects via Computer Algebra Experimentation

Mikhail Klin, Andrew J. Woldar, Sven Reichard, 2009, Algorithmic Algebraic Combinatorics and Gröbner Bases.

Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics

Mikhail Klin, Aiso Heinze, M. Klin, 2009, Algorithmic Algebraic Combinatorics and Gröbner Bases.

Classification of highly symmetrical translation loops of order $$2p, p$$ prime

A. Woldar, M. Klin, Nimrod Kriger, 2014 .

A non-Schurian coherent configuration on 14 points exists

Mikhail H. Klin, Matan Ziv-Av, M. Klin, 2017, Des. Codes Cryptogr..

Primitivity of Permutation Groups, Coherent Algebras and Matrices

Mikhail H. Klin, Gareth A. Jones, Yossi Moshe, 2002, J. Comb. Theory, Ser. A.

Some new non-Schurian association schemes on 2p2 points, p an odd prime, and related combinatorial structures

Mikhail H. Klin, Stefan Gyürki, M. Klin, 2017, Australas. J Comb..

A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices

Mikhail H. Klin, Christian Pech, M. Klin, 2011, Ars Math. Contemp..

Directed strongly regular graphs obtained from coherent algebras

Akihiro Munemasa, Mikhail Klin, Mikhail Muzychuk, 2004 .