Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-10T14:04:54.186Z Has data issue: false hasContentIssue false
  • English
  • Français

Isomorphism Classes of Graph Bundles

Published online by Cambridge University Press:  20 November 2018

Jin Ho Kwak  and
Jaeun Lee
Jin Ho Kwak
Affiliation:
Mathematics, Pohang Institute of Science and Technology, Pohang, 790-600 Korea
Jaeun Lee
Affiliation:
Mathematics, Kyungpook National University, Taegu, 702-701 Korea
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Recently, M. Hofmeister [4] counted all nonisomorphic double coverings of a graph by using its Ζ2 cohomology groups, and J. Kwak and J. Lee [5] did the same work for some finite-fold coverings. In this paper, we give an algebraic characterization of isomorphic graph bundles, from which we get a formula to count all nonisomorphic graph-bundles. Some applications to wheels are also discussed.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 42 , Issue 4 , 01 August 1990 , pp. 747 - 761
Copyright
Copyright © Canadian Mathematical Society 1990

References

1. Bondy, J.A. and Murty, U.S.R., Graph Theory with Applications (Amer. Elsevier, New York, 1976)Google Scholar
2. Gross, J.L. and Tucker, T.W., Topological Graph Theory (John Wiley and Sons, New York, 1987)Google Scholar
3. Gross, J.L. and Tucker, T.W., Generating all graph coverings by permutation voltage assignments,, Discrete Math. 18 (1977), 273–283.Google Scholar
4. Hofmeister, M., Counting double covers of graphs, J. Graph Theory 12 (1988), 437–444.Google Scholar
5. Kwak, J.H. and Lee, J., Counting some finite-fold coverings, To appear.Google Scholar
6. Mohar, B., Pisanski, T. and Skoviera, M., The maximum genus of graph bundles, Europ. J. Combinatorics 9 (1988), 215–224.Google Scholar
7. Pisanski, T., Shawe-Taylor, J. and Vrabec, J., Edge-colorability of graph bundles, J. Combin. Theory, Ser. B 35 (1983), 12–19.Google Scholar
8. Whitney, H., Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932), 150–168.Google Scholar