Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Nonnormal Edge-Transitive Cubic Cayley Graphs of Dihedral Groups

View through CrossRef
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 determine all cubic, connected, and undirected edge-transitive Cayley graphs of dihedral groups, which are not normal edge transitive. This is a partial answer to the question of Praeger (1999).
Title: Nonnormal Edge-Transitive Cubic Cayley Graphs of Dihedral Groups
Description:
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 determine all cubic, connected, and undirected edge-transitive Cayley graphs of dihedral groups, which are not normal edge transitive.
This is a partial answer to the question of Praeger (1999).

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...
Finite edge-transitive Cayley graphs and rotary Cayley maps
Finite edge-transitive Cayley graphs and rotary Cayley maps
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 ...
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...
Graf Cayley Graf Cayley pada Grup Dihedral D_2n
Graf Cayley Graf Cayley pada Grup Dihedral D_2n
Misalkan G adalah grup berhingga dan H adalah subhimpunan inverse-closed dari G di mana e bukan anggota H dan h ? H ? h-1 ? H, maka graf Cayley ? = Cay (G, H) adalah graf yang dibe...
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...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...
AI-driven zero-touch orchestration of edge-cloud services
AI-driven zero-touch orchestration of edge-cloud services
(English) 6G networks demand orchestration systems capable of managing thousands of distributed microservices under sub-millisecond latency constraints. Traditional centralized app...

Back to Top