<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Semisymmetric elementary abelian covers of the Möbius-Kantor graph</dc:title><dc:creator>Malnič,	Aleksander	(Avtor)
	</dc:creator><dc:creator>Marušič,	Dragan	(Avtor)
	</dc:creator><dc:creator>Miklavič,	Štefko	(Avtor)
	</dc:creator><dc:creator>Potočnik,	Primož	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>graph</dc:subject><dc:subject>covering projection</dc:subject><dc:subject>lifting automorphisms</dc:subject><dc:subject>homology group</dc:subject><dc:subject>group representation</dc:subject><dc:subject>matrix group</dc:subject><dc:subject>invariant subspaces</dc:subject><dc:description>Let ▫$\wp_N : \tilde{X} \to X$▫ be a regular covering projection of connected graphs with the group of covering transformations isomorphic to ▫$N$▫. If ▫$N$▫ is an elementary abelian ▫$p$▫-group, then the projection ▫$\wp_N$▫ is called ▫$p$▫-elementary abelian. The projection ▫$\wp_N$▫ is vertex-transitive (edge-transitive) if some vertex-transitive (edge-transitive) subgroup of Aut ▫$X$▫ lifts along ▫$\wp_N$▫, and semisymmetric if it is edge- but not vertex-transitive. The projection ▫$\wp_N$▫ is minimal semisymmetric if ▫$\wp_N$▫ cannot be written as a composition ▫$\wp_N = \wp \circ \wp_M$▫ of two (nontrivial) regular covering projections, where ▫$\pw_M$▫ is semisymmetric. Finding elementary abelian covering projections can be grasped combinatorially via a linear representation of automorphisms acting on the first homology group of the graph. The method essentially reduces to finding invariant subspaces of matrix groups over prime fields (see [A. Malnic, D. Marušic, P. Potocnik, Elementary abelian covers of graphs, J. Algebraic Combin. 20 (2004) 71-97]). In this paper, all pairwise nonisomorphic minimal semisymmetric elementary abelian regular covering projections of the Möbius-Kantor graph, the Generalized Petersen graph GP(8,3), are constructed. No such covers exist for ▫$p=2$▫. Otherwise, the number of such covering projections is equal to ▫$(p-1)/4$▫ and ▫$1+(p-1)/4$▫ in cases ▫$p \equiv 5,9,13,17,21 \pmod{24}$▫ and ▫$p \equiv 1 \pmod{24}$▫, respectively, and to ▫$(p+1)/4$▫ and ▫$1+(p+1)/4$▫ in cases ▫$p \equiv 3,7,11,15,23 \pmod{24}$▫ and ▫$p \equiv 19 \pmod{24}$▫, respectively. For each such covering projection the voltage rules generating the corresponding covers are displayed explicitly.</dc:description><dc:date>2007</dc:date><dc:date>2016-04-08 16:46:28</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>7723</dc:identifier><dc:identifier>ISSN: 0012-365X</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>OceCobissID: 1118479</dc:identifier><dc:identifier>COBISS.SI-ID: 14337113</dc:identifier><dc:language>sl</dc:language></metadata>
