FAST COMPUTATIONS IN VOLTAGE GRAPH THEORY
- 1 May 1979
- journal article
- Published by Wiley in Annals of the New York Academy of Sciences
- Vol. 319 (1) , 247-253
- https://doi.org/10.1111/j.1749-6632.1979.tb32796.x
Abstract
Summary: This paper introduces convenient algorithms to determine two properties of the covering space derived from a voltage assignment on an imbedded graph. One algorithm is to count the number of components of the covering. The other is to decide when the covering surface is orientable. The computational advantages of these algorithms are realized mainly when the base graph has more than one vertex or when the voltage group is described by a presentation rather than an explicit specification. The key principle is to consider the voltage values on a cycle basis.Keywords
This publication has 6 references indexed in Scilit:
- Generating all graph coverings by permutation voltage assignmentsDiscrete Mathematics, 1977
- Genus embeddings for some complete tripartite graphsDiscrete Mathematics, 1976
- The topological theory of current graphsJournal of Combinatorial Theory, Series B, 1974
- Quotients of complete graphs: revisiting the Heawood map-coloring problemPacific Journal of Mathematics, 1974
- Voltage graphsDiscrete Mathematics, 1974
- Ueber das Problem der NachbargebieteMathematische Annalen, 1891