( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Analytic Enumeration of Circulant Graphs

, , и . Preprint, MATH-AL-07-2003. TU Dresden, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Mark Klin

Véronique Héon-Klin

Mikhail Karnevskiy

Mikhail Dobrynin

Mikhail Salzmann

 

Другие публикации лиц с тем же именем

On the Analytic Enumeration of Circulant Graphs, , и . Preprint, MATH-AL-07-2003. TU Dresden, (2003)Some new non-Schurian association schemes on 2p2 points, p an odd prime, and related combinatorial structures., и . Australas. J Comb., (2017)on the Mathematical Model of Triangulanes., , и . Discret. Appl. Math., 67 (1-3): 175-187 (1996)Enumeration of Schur Rings over the Group A 5., и . CASC, том 8136 из Lecture Notes in Computer Science, стр. 219-230. Springer, (2013)Galois correspondence between permutation groups and cellular rings (association schemes)., , и . Graphs Comb., 6 (4): 303-332 (1990)The isomorphism problem for circulant graphs via Schur ring theory., , и . Codes and Association Schemes, том 56 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 241-264. DIMACS/AMS, (1999)Examples of computer experimentation in algebraic combinatorics., , , , и . Ars Math. Contemp., 3 (2): 237-258 (2010)Computer algebra investigation of known primitive triangle-free strongly regular graphs., и . SCSS, том 15 из EPiC Series in Computing, стр. 108-123. EasyChair, (2013)For Computations with Coherent Configurations., и . ISSAC, стр. 219-223. ACM, (1991)Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation., и . CASC, том 8660 из Lecture Notes in Computer Science, стр. 155-170. Springer, (2014)