Article
Cited 13 time in 
Cited 13 time in 
Cited 13 time in
Metadata Downloads
COUNTING SOME FINITE-FOLD COVERINGS OF A GRAPH SCIE SCOPUS
- Title
- COUNTING SOME FINITE-FOLD COVERINGS OF A GRAPH
- Date Issued
- 1992-01
- Publisher
- SPRINGER TOKYO
- Abstract
- Recently, Hofmeister [3] has counted all nonisomorphic double coverings of a graph by using its Z2 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.
- ISSN
- 0911-0119
- Article Type
- Article
- Citation
- GRAPHS AND COMBINATORICS, vol. 8, no. 3, page. 277 - 285, 1992-01
- 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.