<?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=8841"><dc:title>Odd automorphisms in vertex-transitive graphs</dc:title><dc:creator>Hujdurović,	Ademir	(Avtor)
	</dc:creator><dc:creator>Kutnar,	Klavdija	(Avtor)
	</dc:creator><dc:creator>Marušič,	Dragan	(Avtor)
	</dc:creator><dc:subject>graph</dc:subject><dc:subject>vertex-transitive</dc:subject><dc:subject>automorphism group</dc:subject><dc:subject>even permutation</dc:subject><dc:subject>odd permutation</dc:subject><dc:description>An automorphism of a graph is said to be even/odd if it acts on the set of vertices as an even/odd permutation. In this article we pose the problem of determining which vertex-transitive graphs admit odd automorphisms. Partial results for certain classes of vertex-transitive graphs, in particular for Cayley graphs, are given. As a consequence, a characterization of arc-transitive circulants without odd automorphisms is obtained.</dc:description><dc:date>2016</dc:date><dc:date>2017-11-14 03:42:49</dc:date><dc:type>Neznano</dc:type><dc:identifier>8841</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
