Hostname: page-component-cb9f654ff-qc88w Total loading time: 0 Render date: 2025-09-04T03:23:20.709Z Has data issue: false hasContentIssue false
  • English
  • Français

Bipartite graph bundles with connected fibres

Published online by Cambridge University Press:  17 April 2009

Sungpyo Hong ,
Jin Ho Kwak  and
Jaeun Lee
Sungpyo Hong
Affiliation:
Department of Mathematics, Pohang University of Science and Technology, Pohang, 790–784, Korea e-mail: sungpyo@postech.ac.kr
Jin Ho Kwak
Affiliation:
Department of Mathematics, Pohang University of Science and Technology, Pohang, 790–784, Korea e-mail: jinkwak@postech.ac.kr
Jaeun Lee
Affiliation:
Department of Mathematics, Yeungnam University, Kyongsan, 712–749, Korea e-mail: julee@ynucc.yeungnam.ac.kr
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.

Let G be a finite connected simple graph. The isomorphism classes of graph bundles and graph coverings over G have been enumerated by Kwak and Lee. Recently, Archdeacon and others characterised bipartite coverings of G and enumerated the isomorphism classes of regular 2p-fold bipartite coverings of G, when G is nonbipartite. In this paper, we characterise bipartite graph bundles over G and derive some enumeration formulas of the isomorphism classes of them when the fibre is a connected bipartite graph. As an application, we compute the exact numbers of the isomorphism classes of bipartite graph bundles over G when the fibre is the path Pn or the cycle Cn.

Information

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 59 , Issue 1 , February 1999 , pp. 153 - 161
Copyright
Copyright © Australian Mathematical Society 1999

References

[1]Archdeacon, D., Kwak, J.H., Lee, J. and Sohn, M.Y., ‘Bipartite covering graphs’, (preprint).Google Scholar
[2]Gross, J.L. and Tucker, T.W., ‘Generating all graph coverings by permutation voltage assignments’, Discrete Math. 18 (1977), 273–283.CrossRefGoogle Scholar
[3]Gross, J.L. and Tucker, T.W., Topological graph theory (Wiley, New York, 1987).Google Scholar
[4]Hofmeister, M., ‘Counting double covers of graphs’, J. Graph Theory 12 (1988), 437–44.CrossRefGoogle Scholar
[5]Kwak, J.H., Chun, J.H. and Lee, J., ‘Enumeration of regular graph coverings having finite abelian covering transformation groups’, SIAM J. Discrete Math. 11 (1998), 273–285.CrossRefGoogle Scholar
[6]Kwak, J.H. and Lee, J., ‘Isomorphism classes of graph bundles’, Canad. J. Math. 42 (1990), 747–761.CrossRefGoogle Scholar
[7]Mohar, B., Pisanski, T. and Škoviera, M., ‘The maximum genus of graph bundles’, European J. Combin. 9 (1988), 215–224.CrossRefGoogle Scholar
[8]Waller, D.A., ‘Double covers of graphs’, Bull. Austral. Math. Soc. 14 (1976), 233–248.CrossRefGoogle Scholar