<?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=17614"><dc:title>The automorphism groups of non-edge transitive rose window graphs</dc:title><dc:creator>Dobson,	Edward Tauscher	(Avtor)
	</dc:creator><dc:creator>Kovács,	István	(Avtor)
	</dc:creator><dc:creator>Miklavič,	Štefko	(Avtor)
	</dc:creator><dc:subject>rose window graphs</dc:subject><dc:subject>automorphism group</dc:subject><dc:subject>isomorphism problem</dc:subject><dc:subject>vertex-transitive graph</dc:subject><dc:description>In this paper, we determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we determine the isomorphism classes of non-edge-transitive rose window graphs.</dc:description><dc:date>2015</dc:date><dc:date>2021-12-31 00:53:10</dc:date><dc:type>Neznano</dc:type><dc:identifier>17614</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>