Cubic vertex-transitive non-Cayley graphs of order \(8p\) (Q426824): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Yan Quan Feng / rank
Normal rank
 
Property / author
 
Property / author: Yan Quan Feng / rank
 
Normal rank
Property / review text
 
Summary: A graph is vertex-transitive if its automorphism group acts transitively on its vertices. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertex-transitive non-Cayley graphs of order \(8p\) are classified for each prime \(p\). It follows from this classification that there are two sporadic and two infinite families of such graphs, of which the sporadic ones have order \(56\), one infinite family exists for every prime \(p>3\) and the other family exists if and only if \(p \equiv 1\mod 4\). For each family there is a unique graph for a given order.
Property / review text: Summary: A graph is vertex-transitive if its automorphism group acts transitively on its vertices. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertex-transitive non-Cayley graphs of order \(8p\) are classified for each prime \(p\). It follows from this classification that there are two sporadic and two infinite families of such graphs, of which the sporadic ones have order \(56\), one infinite family exists for every prime \(p>3\) and the other family exists if and only if \(p \equiv 1\mod 4\). For each family there is a unique graph for a given order. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20B25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6045677 / rank
 
Normal rank
Property / zbMATH Keywords
 
Cayley graphs
Property / zbMATH Keywords: Cayley graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex-transitive graphs
Property / zbMATH Keywords: vertex-transitive graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
automorphism groups
Property / zbMATH Keywords: automorphism groups / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Magma / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:14, 5 March 2024

scientific article
Language Label Description Also known as
English
Cubic vertex-transitive non-Cayley graphs of order \(8p\)
scientific article

    Statements

    Cubic vertex-transitive non-Cayley graphs of order \(8p\) (English)
    0 references
    0 references
    0 references
    12 June 2012
    0 references
    Summary: A graph is vertex-transitive if its automorphism group acts transitively on its vertices. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertex-transitive non-Cayley graphs of order \(8p\) are classified for each prime \(p\). It follows from this classification that there are two sporadic and two infinite families of such graphs, of which the sporadic ones have order \(56\), one infinite family exists for every prime \(p>3\) and the other family exists if and only if \(p \equiv 1\mod 4\). For each family there is a unique graph for a given order.
    0 references
    Cayley graphs
    0 references
    vertex-transitive graphs
    0 references
    automorphism groups
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references