The following pages link to (Q2717209):
Displaying 23 items.
- Cycle Kronecker products that are representable as optimal circulants (Q479029) (← links)
- A construction of the automorphism groups of indecomposable S-rings over \(Z_{2^n}\) (Q536147) (← links)
- Rotational circulant graphs (Q741752) (← links)
- Common circulant homogeneous factorisations of the complete digraph (Q1025915) (← links)
- Schur rings. (Q1039425) (← links)
- Dioid partitions of groups (Q1663807) (← links)
- Automorphism groups of circulant digraphs with applications to semigroup theory (Q1747989) (← links)
- Semidirect products of association schemes (Q1772215) (← links)
- On automorphisms of circulant digraphs on \(p^{m}\) vertices, \(p\) an odd prime (Q1855401) (← links)
- An explicit characterization of arc-transitive circulants (Q2040013) (← links)
- On association schemes with multiplicities 1 or 2 (Q2042926) (← links)
- On automorphisms of the double cover of a circulant graph (Q2121733) (← links)
- On a huge family of non-Schurian Schur rings (Q2138571) (← links)
- Extended Petersen graphs (Q2568480) (← links)
- On WL-rank of Deza Cayley graphs (Q2666591) (← links)
- Coset closure of a circulant S-ring and schurity problem (Q2797023) (← links)
- Circulant graphs: efficient recognizing and isomorphism testing (Q3439301) (← links)
- Commutative Schur Rings of Maximal Dimension (Q3448578) (← links)
- Fusions of Character Tables and Schur Rings of Abelian Groups (Q3510098) (← links)
- Circulant graphs: recognizing and isomorphism testing in polynomial time (Q4675535) (← links)
- (Q5383191) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925529) (← links)
- The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925678) (← links)
