Abstract
Recently, Hofmeister [3] has counted all nonisomorphic double coverings of a graph by using its ℤ2 cohomology groups. In this paper, we give an algebraic characterization of isomorphic finite-fold coverings of a graph from which we derive a formula to count all nonisomorphic coverings of a graph. Some sample enumerations are provided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gross, J.L., Tucker, T.W.: Topological Graph Theory. New York: Wiley (1987)
Generating all graph coverings by permutation voltage assignments. Discrete Math.18, 273–283 (1977)
Hofmeister, M.: Counting double covers of graphs. J. Graph Theory12, 437–444 (1988)
Waller, D.A.: Double covers of graphs. Bull. Austral. Math. Soc.14, 233–248 (1976)
Author information
Authors and Affiliations
Additional information
The first author was supported by KOSEF and the second was supported by TGRC-KOSF.
Rights and permissions
About this article
Cite this article
Kwak, J.H., Lee, J. Counting some finite-fold coverings of a graph. Graphs and Combinatorics 8, 277–285 (1992). https://doi.org/10.1007/BF02349964
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02349964