Mikhail H. Klin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2017

A non-Schurian coherent configuration on 14 points existsMikhail H. Klin, Matan Ziv-Av. dcc, 84(1-2):203-221, 2017. [doi]

2013

Enumeration of Schur Rings over the Group A 5Mikhail H. Klin, Matan Ziv-Av. casc 2013: 219-230 [doi]

Computer algebra investigation of known primitive triangle-free strongly regular graphsMatan Ziv-Av, Mikhail H. Klin. sycss 2013: 108-123 [doi]

2012

Links between two semisymmetric graphs on 112 vertices via association schemesMikhail H. Klin, Josef Lauri, Matan Ziv-Av. JSC, 47(10):1175-1191, 2012. [doi]

2011

A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matricesMikhail H. Klin, Christian Pech. arsmc, 4(2):205-243, 2011. [doi]

2010

Examples of computer experimentation in algebraic combinatoricsMikhail H. Klin, Christian Pech, Sven Reichard, Andrew J. Woldar, Matan Ziv-Av. arsmc, 3(2):237-258, 2010. [doi]

2009

2007

Association schemes on 28 points as mergings of a half-homogeneous coherent configurationMikhail H. Klin, Mikhail E. Muzychuk, Christian Pech, Andrew J. Woldar, Paul-Hermann Zieschang. ejc, 28(7):1994-2025, 2007. [doi]

2005

Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. StrambachAiso Heinze, Mikhail H. Klin. endm, 23:13-21, 2005. [doi]

2004

Algebraic methods for chromatic polynomialsN. L. Biggs, Mikhail H. Klin, P. Reinfeld. ejc, 25(2):147-160, 2004. [doi]

2003

A Root Graph that is Locally the Line Graph of the Peterson GraphAndries E. Brouwer, Jack H. Koolen, Mikhail H. Klin. DM, 264(1-3):13-24, 2003. [doi]

Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 VerticesLeif K. Jørgensen, Mikhail H. Klin. combinatorics, 10, 2003. [doi]

2002

Small vertex-transitive directed strongly regular graphsFrank Fiedler, Mikhail H. Klin, Mikhail E. Muzychuk. DM, 255(1-3):87-115, 2002. [doi]

Primitivity of Permutation Groups, Coherent Algebras and MatricesGareth A. Jones, Mikhail H. Klin, Yossi Moshe. JCT, 98(1):210-217, 2002. [doi]

1999

Graphical t-designs via polynomial Kramer-Mesner matricesAnton Betten, Mikhail H. Klin, Reinhard Laue, Alfred Wassermann. DM, 197-198:83-109, 1999. [doi]

The isomorphism problem for circulant graphs via Schur ring theoryMikhail E. Muzychuk, Mikhail H. Klin, Reinhard Pöschel. dimacs 2001: 241-264

1998

On graphs with three eigenvaluesMikhail E. Muzychuk, Mikhail H. Klin. DM, 189(1-3):191-207, 1998. [doi]

1996

on the Mathematical Model of TriangulanesMikhail E. Muzychuk, Mikhail H. Klin, Nikolai S. Zefirov. DAM, 67(1-3):175-187, 1996. [doi]

1991

For Computations with Coherent ConfigurationsI. A. Faradzev, Mikhail H. Klin. issac 1991: 219-223 [doi]

1990

Galois correspondence between permutation groups and cellular rings (association schemes)I. A. Faradzev, A. A. Ivanov, Mikhail H. Klin. gc, 6(4):303-332, 1990. [doi]

1989

Some new strongly regular graphs Andries E. Brouwer, A. V. Ivanov, Mikhail H. Klin. combinatorica, 9(4):339-344, 1989.

Sign in or sign up to see more results.

runs on WebDSL