| Title: | Isomorphism checking of I-graphs |
|---|
| Authors: | ID Horvat, Boris (Author)
ID Pisanski, Tomaž (Author)
ID Žitnik, Arjana (Author) |
|---|
| Files: |  http://dx.doi.org/10.1007/s00373-011-1086-2
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | IAM - Andrej Marušič Institute
|
|---|
| 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. |
|---|
| Keywords: | mathematics, graph theory, isomorphism, I-graph, generalized Petersen graph |
|---|
| Year of publishing: | 2012 |
|---|
| Number of pages: | str. 823-830 |
|---|
| Numbering: | Vol. 28, no. 6 |
|---|
| PID: | 20.500.12556/RUP-444  |
|---|
| ISSN: | 0911-0119 |
|---|
| UDC: | 519.17 |
|---|
| COBISS.SI-ID: | 16069977 |
|---|
| Publication date in RUP: | 15.10.2013 |
|---|
| Views: | 5021 |
|---|
| Downloads: | 138 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
