101. |
102. |
103. |
104. |
105. |
106. |
107. |
108. |
109. Isomorphism checking of I-graphsBoris Horvat, Tomaž Pisanski, Arjana Žitnik, 2012, izvirni znanstveni članek Opis: 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. Ključne besede: mathematics, graph theory, isomorphism, I-graph, generalized Petersen graph Objavljeno v RUP: 15.10.2013; Ogledov: 4173; Prenosov: 136 Povezava na celotno besedilo |
110. |