Graph covering projections arising from finite vector spaces over finite fields
β Scribed by M. Hofmeister
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 655 KB
- Volume
- 143
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
It is well known that regular graph covering projections may be described by certain voltage assignments. Further investigations can be done if the voltage group is abelian. The purpose of this paper is to classify isomorphism of regular graph covering projections of a graph G that arise from finite abelian groups as voltage groups. In particular, if the voltage group is a finite-dimensional vector space over a finite field and the automorphism group is trivial, the corresponding isomorphism classes will be counted.
π SIMILAR VOLUMES
We study a combinatorial problem for vector spaces over finite fields which generalizes the following classical problem in algebraic coding theory: given a finite field Fq and integers n > k 2 1, find the largest minimum distance that can be achieved by a linear code over Fq with fixed length n and
Cayley graphs on a subgroup of GΒΈ(3, p), p'3 a prime, are defined and their properties, particularly their spectra, studied. It is shown that these graphs are connected, vertex-transitive, nonbipartite, and regular, and their degrees are computed. The eigenvalues of the corresponding adjacency matri
We study the geometrical properties of the subgroups of the mutliplicative group of a "nite extension of a "nite "eld endowed with its vector space structure and we show that in some cases the associated projective space has a natural group structure. We construct some cyclic codes related to Reed}M