<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=1311"><dc:title>On quartic half-arc-transitive metacirculants</dc:title><dc:creator>Marušič,	Dragan	(Avtor)
	</dc:creator><dc:creator>Šparl,	Primož	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>metacirculant graph</dc:subject><dc:subject>half-arc-transitive graph</dc:subject><dc:subject>tightly attached</dc:subject><dc:subject>automorphism group</dc:subject><dc:description>Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ▫$\rho$▫ and ▫$\sigma$▫, where ▫$\rho$▫ is ▫$(m,n)$▫-semiregular for some integers ▫$m \ge 1$▫, ▫$n \ge 2▫$, and where ▫$\sigma$▫ normalizes ▫$\rho$▫, cyclically permuting the orbits of ▫$\rho$▫ in such a way that ▫$\sigma^m$▫ has at least one fixed vertex. A half-arc-transitive graph is a vertex- and edge- but not arc-transitive graph. In this article quartic half-arc-transitive metacirculants are explored and their connection to the so called tightly attached quartic half-arc-transitive graphs is explored. It is shown that there are three essentially different possibilities for a quartic half-arc-transitive metacirculant which is not tightly attached to exist. These graphs are extensively studied and some infinite families of such graphs are constructed.</dc:description><dc:date>2008</dc:date><dc:date>2013-10-15 12:05:48</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>1311</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
