<?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>Isomorphism checking of I-graphs</dc:title><dc:creator>Horvat,	Boris	(Avtor)
	</dc:creator><dc:creator>Pisanski,	Tomaž	(Avtor)
	</dc:creator><dc:creator>Žitnik,	Arjana	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>isomorphism</dc:subject><dc:subject>I-graph</dc:subject><dc:subject>generalized Petersen graph</dc:subject><dc:description>We consider the class of ▫$I$▫-graphs, which is a generalization of the class of the generalized Petersen graphs. We show that two ▫$I$▫-graphs ▫$I(n, j, k)$▫ and ▫$I(n, j_1, k_1)$▫ are isomorphic if and only if there exists an integer ▫$a$▫ relatively prime to $n$ such that either ▫$\{j_1, k_1\} = \{aj \mod n, \; ak \mod n \}$▫ or ▫$\{j_1, k_1\} = \{aj \mod n, \; -ak \mod n\}$▫. This result has an application in the enumeration of non-isomorphic ▫$I$▫-graphs and unit-distance representations of generalized Petersen graphs.</dc:description><dc:date>2012</dc:date><dc:date>2013-10-15 12:04:50</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>444</dc:identifier><dc:identifier>ISSN: 0911-0119</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>COBISS.SI-ID: 16069977</dc:identifier><dc:language>sl</dc:language></metadata>
