<?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=7722"><dc:title>Semiregular automorphisms of vertex-transitive graphs of certain valencies</dc:title><dc:creator>Dobson,	Edward Tauscher	(Avtor)
	</dc:creator><dc:creator>Malnič,	Aleksander	(Avtor)
	</dc:creator><dc:creator>Marušič,	Dragan	(Avtor)
	</dc:creator><dc:creator>Nowitz,	Lewis A.	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>transitive permutation group</dc:subject><dc:subject>2-closed group</dc:subject><dc:subject>semiregular automorphism</dc:subject><dc:subject>vertex-transitive graph</dc:subject><dc:description>It is shown that a vertex-transitive graph of valency ▫$p+1$▫, ▫$p$▫ a prime, admitting a transitive action of a ▫$\{2,p\}$▫-group, has a non-identity semiregular automorphism. As a consequence, it is proved that a quartic vertex-transitive graph has a non-identity semiregular automorphism, thus giving a partial affirmative answer to the conjecture that all vertex-transitive graphs have such an automorphism and, more generally, that all 2-closed transitive permutation groups contain such an element (see [D. Marušic, On vertex symmetric digraphs, Discrete Math. 36 (1981) 69-81; P.J. Cameron (Ed.), Problems from the Fifteenth British Combinatorial Conference, Discrete Math. 167/168 (1997) 605-615]).</dc:description><dc:date>2007</dc:date><dc:date>2016-04-08 16:46:27</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>7722</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
