No label defined (Q4431069)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1990891
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1990891

      Statements

      0 references
      0 references
      0 references
      13 October 2003
      0 references
      automorphism groups of graphs
      0 references
      Cayley (di)graphs \(\Gamma= \text{Cay}(G,S)\) are studied where \(G\) is a finite group with unit element 1 and \(S\subseteq G\setminus \{1\}\). Two Cayley graphs \(\text{Cay}(G,S)\) and \(\text{Cay}(G,T)\) are said to be equivalent if \(S\) can be transformed into \(T\) by an automorphism of \(G\). If \(N_{\Aut(\Gamma)}(G)\) is transitive on the edges of \(\Gamma\), then \(\Gamma\) is called a normal edge-transitive Cayley graph. Denote by \(\Aut(G,S)\) the group of the automorphisms of \(G\) which leave \(S\) invariant (globally). It is known that \(G.\Aut(G,S)\) is a subgroup of \(\Aut(\Gamma)\). Let \(Z_n\) be the additive group \((\text{mod\,}n)\) on the set \(\{0,1,2,\dots, n-1\}\). The first main result states that if (i) \(G\) is a noncommutative simple group, (ii) \(\Gamma\) is a connected undirected graph of valency three and (iii) \(\Gamma\) is normal edge-transitive as an undirected graph, then \(G.\Aut(G, S)\) coincides with \(\Aut(\Gamma)\). In the second theorem the graphs \(\text{Cay}(Z_n, S)\) are considered where \(n\) is fixed and \(S\) runs through the subgroups of \(\Aut(Z_n)\). It is shown that these graphs are pairwise non-isomorphic; in addition, exactly the normal edge-transitive connected circulant graphs of order \(n\) are thus obtained up to equivalence.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references