ARTICLE
TITLE

Edge Transitive Dihedral Covers of The Heawood Graph

SUMMARY

A regular cover of a connected graph is called dihedral ifits transformation group is dihedral. In this paper, the authors clas-sify all dihedral coverings of the Heawood graph whose fibre-preservingautomorphism subgroups act edge-transitively.

PAGES
pp. 1 - 6
COLLECTIONS
Mathematics

 Articles related

Shu Jiao Song    

In this paper we introduce and study a type of Cayley graph – subnormal Cayley graph. We prove that a subnormal 2-arc transitive Cayley graph is a normal Cayley graph or a normal cover of a complete bipartite graph Kpd,pd\mathbf{K}_{p^d,p^d} with pp... see more


Mehdi Alaeiyan,Rasul Aramian    

A simple undirected graph is called semisymmetric if it is regular and edge transitive but not vertex-transitive. In this paper, we classify all connected cubic semisymmetric graph of order 34<em>p²</em>, where p be a prime.DOI : ht... see more


Robert Jajcay, Štefko Miklavic, Primož Šparl, Gorazd Vasiljevic    

-


Marko Orel    

In this note we consider two related infinite families of graphs, which generalize the Petersen and the Coxeter graph. The main result proves that these graphs are cores. It is determined which of these graphs are vertex/edge/arc-transitive or distance-r... see more


Cai Heng Li, Zai Ping Lu, Gai Xia Wang    

-