Abstract. Finite groups can be constructed from smaller groups by means of extensions. In particular, if a group G has a normal subgroup N, then a ‘2-cocycle ’ is needed in addition to the ab-stract groups N and G/N in order to pin down G. In this project we want to use the theory of voltage covers of graphs to make this reconstruction of G from the triple N, G/N, and the cocycle geometric. 1
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
AbstractAn action graph is a combinatorial representation of a group acting on a set. Comparing two ...
AbstractAny group of automorphisms of a graph G induces a notion of isomorphism between covering pro...
Apart from mathematics, covering techniques have long been known as a powerful tool in different are...
AbstractThis paper introduces the permutation voltage graph construction, which is a generalization ...
We present some topics on graph covering and its generalization. We survey some results on enumerati...
The field of topological graph theory has expanded greatly in the ten years since the first edition ...
AbstractVoltage graphs, one of the main tools for constructing graph embeddings, appear to be useful...
AbstractIn the usual treatment of covering spaces, the algebraic object associated with a cover is a...
AbstractThe problem of lifting graph automorphisms along covering projections and the analysis of li...
Graphs of groups were first introduced by Jean-Pierre Serre in his book entitled Arbres, Amalgames, ...
It has been known that any covering space of a suitable topological space can be covered by a regula...
AbstractA general method for finding elementary abelian regular covering projections of finite conne...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
O propÃsito desta dissertaÃÃo à apresentar aplicaÃÃes da Teoria dos Grafos à Teoria dos Grupos. De p...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
AbstractAn action graph is a combinatorial representation of a group acting on a set. Comparing two ...
AbstractAny group of automorphisms of a graph G induces a notion of isomorphism between covering pro...
Apart from mathematics, covering techniques have long been known as a powerful tool in different are...
AbstractThis paper introduces the permutation voltage graph construction, which is a generalization ...
We present some topics on graph covering and its generalization. We survey some results on enumerati...
The field of topological graph theory has expanded greatly in the ten years since the first edition ...
AbstractVoltage graphs, one of the main tools for constructing graph embeddings, appear to be useful...
AbstractIn the usual treatment of covering spaces, the algebraic object associated with a cover is a...
AbstractThe problem of lifting graph automorphisms along covering projections and the analysis of li...
Graphs of groups were first introduced by Jean-Pierre Serre in his book entitled Arbres, Amalgames, ...
It has been known that any covering space of a suitable topological space can be covered by a regula...
AbstractA general method for finding elementary abelian regular covering projections of finite conne...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
O propÃsito desta dissertaÃÃo à apresentar aplicaÃÃes da Teoria dos Grafos à Teoria dos Grupos. De p...
For a given finite connected graph Gamma, a group H of automorphisms of Gamma and a finite group A, ...
AbstractAn action graph is a combinatorial representation of a group acting on a set. Comparing two ...
AbstractAny group of automorphisms of a graph G induces a notion of isomorphism between covering pro...