ISOMORPHISMS AND AUTOMORPHISMS OF GRAPH COVERINGS

被引：33

作者：

HOFMEISTER, M

机构：

[1] Mathematisches Institut, Universität zu Köln, Köln

来源：

DISCRETE MATHEMATICS | 1991年 / 98卷 / 03期

关键词：

D O I：

10.1016/0012-365X(91)90374-B

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Any group of automorphisms of a graph G induces a notion of isomorphism between covering projections onto G. Liftings of automorphisms of G are considered, and the isomorphism classes of covering projections onto G are classified by means of permutation voltage assignments. In the case of trivial automorphisms of the base graph, a counting formula is given.

引用

页码：175 / 183

页数：9

共 11 条

[1]

Biggs N., 1974, ALGEBRAIC GRAPH THEO

[2]

FARZAN M, 1976, PUBL CNRS, V260, P137

[3]

Gross J. L., 1987, WILEY INTERSCI SER D

[4] GENERATING ALL GRAPH COVERINGS BY PERMUTATION VOLTAGE ASSIGNMENTS [J].