GRAPH COVERS
The source code


This page provides the Magma language functions for doing computations with covers of graphs.

Census of tetravalent (G,1/2)-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8

A magma file containing all tetravalent (G,1/2)-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8 on at most 10762 vertices, up to isomorphism, is available for download here. This mgm file requires also this txt file (zipped). The csv file containing the list of all graphs in the census, together with some graph-theoretical invariants is also available and can be downloaded here. More about this can be found in the paper P. Potočnik, R. Požar, Smallest tetravalent half-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8, submitted for publication.

Downloads

A package on graph covers.

The following paper describes the method for testing whether the lifted group is a split extension when the group of covering transformations is (elementary) abelian.

The following paper describes the method for generating admissible regular graph covers with a solvable group of covering transformations, up to a prescribed order of the respective covering graphs.

  • R. Požar, Some computational aspects of solvable regular covers of graphs, J. Symbolic Comput. (2014), doi: 10.1016/j.jsc.2014.09.023 (preprint)
Copyright © Rok Pozar 2013-2014