Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme


1 - 1 / 1
First pagePrevious page1Next pageLast page
Isomorphism checking of I-graphs
Boris Horvat, Tomaž Pisanski, Arjana Žitnik, 2012, original scientific article

Abstract: 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.
Found in: osebi
Keywords: mathematics, graph theory, isomorphism, I-graph, generalized Petersen graph
Published: 15.10.2013; Views: 1603; Downloads: 76
URL Full text (0,00 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica