Javascript must be enabled to continue!
Finite edge-transitive Cayley graphs and rotary Cayley maps
View through CrossRef
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry. The theory consists of analysing several types of basic Cayley graphs (normal, bi-normal, and core-free), and analysing several operations of Cayley graphs (core quotient, normal quotient, and imprimitive quotient). It provides methods for constructing and characterising various combinatorial objects, such as half-transitive graphs, (orientable and non-orientable) regular Cayley maps, vertex-transitive non-Cayley graphs, and permutation groups containing certain regular subgroups. In particular, a characterisation is given of locally primitive holomorph Cayley graphs, and a classification is given of rotary Cayley maps of simple groups. Also a complete classification is given of primitive permutation groups that contain a regular dihedral subgroup.
Title: Finite edge-transitive Cayley graphs and rotary Cayley maps
Description:
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry.
The theory consists of analysing several types of basic Cayley graphs (normal, bi-normal, and core-free), and analysing several operations of Cayley graphs (core quotient, normal quotient, and imprimitive quotient).
It provides methods for constructing and characterising various combinatorial objects, such as half-transitive graphs, (orientable and non-orientable) regular Cayley maps, vertex-transitive non-Cayley graphs, and permutation groups containing certain regular subgroups.
In particular, a characterisation is given of locally primitive holomorph Cayley graphs, and a classification is given of rotary Cayley maps of simple groups.
Also a complete classification is given of primitive permutation groups that contain a regular dihedral subgroup.
Related Results
On isomorphisms of m-Cayley digraphs
On isomorphisms of m-Cayley digraphs
The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In t...
The Cayley Isomorphism Property for Cayley Maps
The Cayley Isomorphism Property for Cayley Maps
The Cayley Isomorphism property for combinatorial objects was introduced by L. Babai in 1977. Since then it has been intensively studied for binary relational structures: graphs, d...
Power Cayley Graphs of Dihedral Groups with Certain Order
Power Cayley Graphs of Dihedral Groups with Certain Order
Combination of the concepts of power graph and Cayley graph associated to groups has led to the introduction to two new variations of Cayley graph known as the union power Cayley g...
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
Roughness in Fuzzy Cayley Graphs
Roughness in Fuzzy Cayley Graphs
Rough set theory is a worth noticing approach for inexact and uncertain system modelling. When rough set theory accompanies with fuzzy set theory, which both are a complementary ge...
Nonnormal Edge-Transitive Cubic Cayley Graphs of Dihedral Groups
Nonnormal Edge-Transitive Cubic Cayley Graphs of Dihedral Groups
A Cayley graph of a finite group is called normal edge transitive if its automorphism group has a subgroup which both normalizes and acts transitively on edges. In this paper we ...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Cayley graphs and cayley Signed graphs over finite commutative rings
Cayley graphs and cayley Signed graphs over finite commutative rings
Let R be a finite commutative ring with identity1≠0. The unitary Cayley graph of R, denoted by Gr, is the graph whose vertex set is R and the edge set {{a,b} : a,bϵR and a-bϵR ˟ },...

