Enumerating typical abelian prime-fold coverings of a circulant graph
نویسندگان
چکیده
Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J. Lee, Isomorphism classes of concrete graph coverings, SIAM J. Discrete Math. 11 (1998) 265–272; R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73–85; R. Feng, J.H. Kwak, Y.S. Kwon, Enumerating typical circulant covering projections onto a circulant graph, SIAM J. Discrete Math. 19 (2005) 196–207; SIAM J. Discrete Math. 21 (2007) 548–550 (erratum); M. Hofmeister, Graph covering projections arising from finite vector spaces over finite fields, Discrete Math. 143 (1995) 87–97; M. Hofmeister, Enumeration of concrete regular covering projections, SIAM J. Discrete Math. 8 (1995) 51–61; M. Hofmeister, A note on counting connected graph covering projections, SIAM J. Discrete Math. 11 (1998) 286–292; J.H. Kwak, J. Chun, J. Lee, Enumeration of regular graph coverings having finite abelian covering transformation groups, SIAM J. Discrete Math. 11 (1998) 273–285; J.H. Kwak, J. Lee, Isomorphism classes of graph bundles, Canad. J. Math. XLII (1990) 747–761]). A covering is called abelian (or circulant, respectively) if its covering graph is a Cayley graph on an abelian (or a cyclic, respectively) group. A covering p from a Cayley graph Cay(A, X) onto another Cay (Q, Y) is called typical if the map p : A→ Q on the vertex sets is a group epimorphism. Recently, the isomorphism classes of connected typical circulant r-fold coverings of a circulant graph are enumerated in [R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73–85] for r = 2 and in [R. Feng, J.H. Kwak, Y.S. Kwon, Enumerating typical circulant covering projections onto a circulant graph, SIAM J. Discrete Math. 19 (2005) 196–207 ; SIAM J. Discrete Math. 21 (2007) 548–550 (erratum)] for any r. As a continuation of these works, we enumerate in this paper the isomorphism classes of typical abelian prime-fold coverings of a circulant graph. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Typical circulant double coverings of a circulant graph
Several isomorphism classes of graph coverings of a graph G have been enumerated by many authors. Kwak and Lee (Canad. J. Math. XLII (1990) 747) enumerated the isomorphism classes of graph bundles and those of n-fold coverings with respect to a group of automorphisms of the base graph G which 9x a spanning tree. Hofmeister (Discrete Math. 98 (1991) 175) independently enumerated the isomorphism ...
متن کاملEnumerating branched coverings over surfaces with boundaries
The number of nonisomorphic n-fold branched coverings over a given surface with a boundary is determined by the number of nonisomorphic n-fold graph coverings over a suitable bouquet of circles. A similar enumeration can be done for regular branched coverings. Some explicit formulae for enumerations are also obtained. © 2003 Elsevier Ltd. All rights reserved. MSC 2000: 05C10; 05C30; 57M12
متن کاملEnumerating branched orientable surface coverings over a non-orientable surface
The isomorphism classes of several types of graph coverings of a graph have been enumerated by many authors [M. Hofmeister, Graph covering projections arising from finite vector space over finite fields, Discrete Math. 143 (1995) 87–97; S. Hong, J.H. Kwak, J. Lee, Regular graph coverings whose covering transformation groups have the isomorphism extention property, Discrete Math. 148 (1996) 85–1...
متن کاملRecognizing and testing isomorphism of Cayley graphs over an abelian group of order $4p$ in polynomial time
We construct a polynomial-time algorithm that given a graph X with 4p vertices (p is prime), finds (if any) a Cayley representation of X over the group C2 × C2 × Cp. This result, together with the known similar result for circulant graphs, shows that recognising and testing isomorphism of Cayley graphs over an abelian group of order 4p can be done in polynomial time.
متن کاملOn the Enumeration of Circulant Graphs of Prime Power and Square Free Orders
The aim of this work is twofold: to unify, systematize and extend the known results of the analytical (i.e. formula-wise) counting of directed and undirected circulant graphs with a prime or, more generally, square-free number of vertices; to develop a general combinatorial framework for the counting of nonisomorphic circulant graphs with pk vertices, p odd prime, k 2. The general problem of co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009