Constructions of self-complementary circulants with no multiplicative isomorphisms (Q5952155): Difference between revisions
From MaRDI portal
Revision as of 21:08, 3 June 2024
scientific article; zbMATH DE number 1687778
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructions of self-complementary circulants with no multiplicative isomorphisms |
scientific article; zbMATH DE number 1687778 |
Statements
Constructions of self-complementary circulants with no multiplicative isomorphisms (English)
0 references
3 June 2002
0 references
For a finite group \(G\), let \(G^{\#} = G\setminus \{1\} \), the set of all non-identity elements of \(G\). For a set \(S\subseteq G^{\#}\), \(\text{Cay}(G,S)\) is the associated Cayley graph. If \(G\) is cyclic, then \(\text{Cay}(G,S)\) is called a circulant. Let \(\sigma \) be an element of the group of automorphisms of \(G\). A self-complementary Cayley graph \(\text{Cay}(G,S)\) is an SCI-graph (here SCI stands for Self-complementary Cayley Isomorphism) of \(G\) if \(S^{\sigma} = G^{\#}\setminus S\) for some \(\sigma \in \text{Aut}(G)\). The question of the existence of self-complementary Cayley graphs that are not SCI-graphs is answered in the positive. Infinite families of such graphs are constructed. All primes \(p\) for which there exist self-complementary circulants of order \(p^2\) which are not SCI-graphs are also characterized.
0 references
self-complementary graphs
0 references
circulant graphs
0 references
Cayley graph
0 references