Edge Transitive Dihedral Covers of The Heawood Graph
نویسندگان
چکیده
منابع مشابه
Arc-transitive abelian regular covers of the Heawood graph
In this sequel to the paper ‘Arc-transitive abelian regular covers of cubic graphs’, all arc-transitive abelian regular covers of the Heawood graph are found. These covers include graphs that are 1-arc-regular, and others that are 4-arc-regular (like the Heawood graph). Remarkably, also some of these covers are 2-arc-regular.
متن کاملArc-Transitive Dihedral Regular Covers of Cubic Graphs
A regular covering projection is called dihedral or abelian if the covering transformation group is dihedral or abelian. A lot of work has been done with regard to the classification of arc-transitive abelian (or elementary abelian, or cyclic) covers of symmetric graphs. In this paper, we investigate arc-transitive dihedral regular covers of symmetric (arc-transitive) cubic graphs. In particula...
متن کاملAbout The Edge Covers of the Graph
The paper is about the edge covers of the graph. The change in the edge covering number of the graph is observed under the operations vertex removal, edge removal and edge addition. The necessary and sufficient condition is proved under which the edge covering number decreases when a vertex is removed from the graph also when an edge is added to the graph. The necessary and sufficient condition...
متن کاملperfect matchings in edge-transitive graph
we find recursive formulae for the number of perfect matchings in a graph g by splitting g into subgraphs h and q. we use these formulas to count perfect matching of p hypercube qn. we also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in g, is the graph constructed from by deleting edges with an en...
متن کاملArc-transitive regular cyclic covers of the complete bipartite graph
Characterizing regular covers of edge-transitive or arc-transitive graphs is currently a hot topic in algebraic graph theory. In this paper, we will classify arctransitive regular cyclic covers of the complete bipartite graph Kp,p for each odd prime p. The classification consists of four infinite families of graphs. In particular, such covers exist for each odd prime p. The regular elementary a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Indonesian Mathematical Society
سال: 2018
ISSN: 2460-0245,2086-8952
DOI: 10.22342/jims.24.2.232.1-6