Abstract
Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory. A covering of G is called circulant if its covering graph is circulant. Recently, the authors [Discrete Math., 277, 73–85 (2004)] enumerated the isomorphism classes of circulant double coverings of a certain type, called a typical covering, and showed that no double covering of a circulant graph of valency three is circulant. Also, in [Graphs and Combinatorics, 21, 386–400 (2005)], the isomorphism classes of circulant double coverings of a circulant graph of valency four are enumerated. In this paper, the isomorphism classes of circulant double coverings of a circulant graph of valency five are enumerated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bermond, J. C., Comellas, F., Hsu, D. F.: Distributed loop computer networks: a survey. J. Parallel Distrib. Comput., 24, 2–10 (1995)
Park, J. H., Chwa, K. Y.: Recursive circulant: a new topology for multicomputer networks, Proc. Internat. Symp. Parallel Architectures, Algorithms and Networks (ISPAN’94), IEEE press, New York, 73–80, 1994
Gross, J. L., Tucker, T. W.: Generating all graph coverings by permutation voltage assignments. Discrete Math., 18, 273–283 (1977)
Feng, R., Kwak, J. H., Kim, J., Lee, J.: Isomorphism classes of concrete graph coverings. SIAM J. Disc. Math., 11, 265–272 (1998)
Hofmeister, M.: Isomorphisms and automorphisms of coverings. Discrete Math., 98 175–183 (1991)
Hong, S., Kwak, J. H., Lee, J.: Regular graph coverings whose covering transformation groups have the isomorphism extension property. Discrete Math., 148, 85–105 (1996)
Kwak, J. H., Chun, J., Lee, J.: Enumeration of regular graph coverings having finite abelian covering transformation groups. SIAM J. Disc. Math., 11, 273–285 (1998)
Kwak, J. H., Lee, J.: Enumeration of connected graph coverings. J. Graph Theory, 23, 105–109 (1996)
Siagiova, J.: Composition of regular coverings of graphs. J. Electrical Engineering, 50, 75–77 (1999)
Siagiova, J.: Composition of regular coverings of graphs and voltage assignments. Australasian J. Combinatorics, 28, 131–136 (2003)
Feng, R., Kwak, J. H.: Typical circulant double coverings of a circulant graph. Discrete Math., 277, 73–85 (2004)
Feng, R., Kwak, J. H., Kwon, Y. S.: Enumerating typical circulant covering projections onto a circulant graph. SIAM J. Disc. Math., 19, 196–207 (2005)
Kwak, J. H., Lee, J.: Isomorphism classes of graph bundles. Canad. J. Math., XLII, 747–761 (1990)
Feng, R., Kwak, J. H.: Circulant double coverings of a circulant graph of valency four. Graphs and Combinatorics, 21, 386–400 (2005)
Author information
Authors and Affiliations
Corresponding author
Additional information
The first author is supported by NSF of China (No. 60473019 and 10571005) and by NKBRPC (2004CB318000), and the second author is supported by Com2MaC–KOSEF in Korea
Rights and permissions
About this article
Cite this article
Feng, R.Q., Kwak, J.H. Circulant Double Coverings of a Circulant Graph of Valency Five. Acta Math Sinica 23, 23–28 (2007). https://doi.org/10.1007/s10114-005-0773-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10114-005-0773-4