scientific article
From MaRDI portal
Publication:2717209
zbMath0979.05079MaRDI QIDQ2717209
Mikhail H. Klin, Reinhard Pöschel, Mikhail E. Muzychuk
Publication date: 21 February 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (23)
On automorphisms of the double cover of a circulant graph ⋮ Commutative Schur Rings of Maximal Dimension ⋮ On a huge family of non-Schurian Schur rings ⋮ Dioid partitions of groups ⋮ On WL-rank of Deza Cayley graphs ⋮ Fusions of Character Tables and Schur Rings of Abelian Groups ⋮ Cycle Kronecker products that are representable as optimal circulants ⋮ Automorphism groups of circulant digraphs with applications to semigroup theory ⋮ A construction of the automorphism groups of indecomposable S-rings over \(Z_{2^n}\) ⋮ Semidirect products of association schemes ⋮ Circulant graphs: recognizing and isomorphism testing in polynomial time ⋮ Coset closure of a circulant S-ring and schurity problem ⋮ An explicit characterization of arc-transitive circulants ⋮ On association schemes with multiplicities 1 or 2 ⋮ Rotational circulant graphs ⋮ Unnamed Item ⋮ Common circulant homogeneous factorisations of the complete digraph ⋮ The Weisfeiler-Leman algorithm and recognition of graph properties ⋮ The Weisfeiler-Leman algorithm and recognition of graph properties ⋮ Schur rings. ⋮ Extended Petersen graphs ⋮ On automorphisms of circulant digraphs on \(p^{m}\) vertices, \(p\) an odd prime ⋮ Circulant graphs: efficient recognizing and isomorphism testing
This page was built for publication:
