Processing math: 100%
Lupa

Show document Help

A- | A+ | Print
Title:Isomorphism checking of I-graphs
Authors:ID Horvat, Boris (Author)
ID Pisanski, Tomaž (Author)
ID Žitnik, Arjana (Author)
Files:URL 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,j1,k1) are isomorphic if and only if there exists an integer a relatively prime to n such that either {j1,k1}={ajmodn,akmodn} or {j1,k1}={ajmodn,akmodn}. 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 This link opens in a new window
ISSN:0911-0119
UDC:519.17
COBISS.SI-ID:16069977 This link opens in a new window
Publication date in RUP:15.10.2013
Views:5530
Downloads:139
Metadata:XML DC-XML DC-RDF
:
HORVAT, Boris, PISANSKI, Tomaž and ŽITNIK, Arjana, 2012, Isomorphism checking of I-graphs. [online]. 2012. Vol. 28, no. 6, p. 823–830. [Accessed 19 March 2025]. Retrieved from: http://dx.doi.org/10.1007/s00373-011-1086-2
Copy citation
  
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Searching for similar works...Please wait....
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:Slovenian
Abstract:Obravnavamo razred I-grafov - posplošitev razreda t.i. posplošenih Petersenovih grafov. Pokažemo da sta I-grafa I(n,j,k) in I(n,j1,k1) izomorfna natanko takrat, ko obstaja celo število a tuje z n, za katerega velja, da drži bodisi {j1,k1}={ajmodn,akmodn} bodisi {j1,k1}={ajmodn,akmodn}. Ta rezultat je uporaben pri preštevanju neizomorfnih I-grafov in predstavitev z enotsko razdaljo posplošenih Petersenovih grafov.
Keywords:matematika, teorija grafov, izomorfizem, I-graf, posplošeni Petersenov graf


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica