Premium
Homological Coverings of Graphs
Author(s) -
Biggs N. L.
Publication year - 1984
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/s2-30.1.1
Subject(s) - mathematics , automorphism , combinatorics , homology (biology) , graph , symmetric graph , finitely generated abelian group , discrete mathematics , voltage graph , line graph , biology , biochemistry , gene
The homology group of a graph, with any coefficient ring, can be used to construct covering graphs. The properties of the covering graph are studied, and it, is proved that they admit group of automorphisms related to the group of the base graph. In the case of cubic graphs the construction throws some light on classification problems and it can be used to show that certain finitely presented groups are infinite.