Enumeration of connected graph coverings
SCIE
SCOPUS
- Title
- Enumeration of connected graph coverings
- Authors
- Kwak, JH; Lee, J
- Date Issued
- 1996-10
- Publisher
- JOHN WILEY & SONS INC
- Abstract
- The number of the isomorphism classes of n-fold coverings of a graph G is enumerated by the authors (Canad. J. Math. XLII (1990), 747-761) and Hofmeister (Discrete Math. 98 (1991), 275-183). But the enumeration of the isomorphism classes of connected n-fold coverings of a graph has not been studied except for n = 2. In this paper, we enumerate the isomorphism classes of connected n-fold coverings of a graph G for any n. As a consequence, we obtain a formula for finding the total number of conjugacy classes of subgroups of a given index of a finitely generated free group. (C) 1996 John Wiley & Sons, Inc.
- Keywords
- FINITE
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/21492
- DOI
- 10.1002/(SICI)1097-0118(199610)23:2<105::AID-JGT1>3.3.CO;2-S
- ISSN
- 0364-9024
- Article Type
- Article
- Citation
- JOURNAL OF GRAPH THEORY, vol. 23, no. 2, page. 105 - 109, 1996-10
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.