Normal edge-transitive Cayley graphs on non-Abelian groups of order \(4p\), where \(p\) is a prime number. (Q1935710): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q1125876 / rank
Normal rank
 
Property / author
 
Property / author: Mohammad-Reza Darafsheh / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11425-012-4415-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167461814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On normal edge-transitive Cayley graphs of some Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge-transitive Cayley graphs of valency four / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the full automorphism group of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tetravalent edge-transitive Cayley graphs with odd number of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maps and half-transitive graphs of valency 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite normal edge-transitive Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphism groups and isomorphisms of Cayley digraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:36, 6 July 2024

scientific article
Language Label Description Also known as
English
Normal edge-transitive Cayley graphs on non-Abelian groups of order \(4p\), where \(p\) is a prime number.
scientific article

    Statements

    Normal edge-transitive Cayley graphs on non-Abelian groups of order \(4p\), where \(p\) is a prime number. (English)
    0 references
    0 references
    19 February 2013
    0 references
    Let \(\Gamma\) be a simple graph. The group of automorphisms of \(\Gamma\) is denoted by \(\Aut(\Gamma)\), which acts on vertices, edges and arcs of \(\Gamma\). If \(\Aut(\Gamma)\) acts transitively on vertices, edges or arcs of \(\Gamma\), then \(\Gamma\) is called vertex-transitive, edge-transitive or arc-transitive, respectively. If \(\Gamma\) is vertex and edge-transitive but not arc-transitive, then \(\Gamma\) is called \(\frac12\) arc-transitive. Let \(G\) be a finite group and \(S\) be an inverse closed subset of \(G\). The Cayley graph \(\Gamma=\text{Cay}(G,S)\) on \(G\) with respect to \(S\) is a graph with vertex set \(G\) and edge set \(\{\{g,sg\}\mid g\in G,\;s\in S\}\). \(\Gamma\) is connected if and only if \(G=\langle S\rangle\). For \(g\in G\), define the mapping \(\rho_g\colon G\to G\) by \(\rho_g(x)=xg\), \(x\in G\). Then, \(R(G)=\{\rho_g\mid g\in G\}\) is a regular subgroup of \(\Aut(\Gamma)\) isomorphic to \(G\), forcing \(\Gamma\) to be a vertex-transitive graph. The graph \(\Gamma\) is called normal if \(R(G)\) is a normal subgroup of \(\Aut(\Gamma)\). In this paper, the authors determine all connected normal edge-transitive Cayley graphs on non-Abelian groups with order \(4p\), where \(p\) is a prime number. As a consequence, if \(|G|=2^\delta p\), \(\delta=0,1,2\) and \(p\) prime, then \(\Gamma=\text{Cay}(G,S)\) is a connected normal \(\frac12\) arc-transitive Cayley graph only if \(G=F_{4p}\), where \(S\) is an inverse closed generating subset of \(G\) which does not contain the identity element of \(G\) and \(F_{4p}\) is a group with presentation \[ F_{4p}=\langle a,b\mid a^p=b^4=1,\;b^{-1}ab=a^\lambda\rangle, \] where \(\lambda^2\equiv -1\pmod p\).
    0 references
    0 references
    finite groups
    0 references
    Cayley graphs
    0 references
    automorphism groups
    0 references
    normal edge-transitive graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references