Processing math: 100%
Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
SLO
Login
Search
Browsing
Upload document
Statistics
RUP
FAMNIT - Faculty of Mathematics, Science and Information Technologies
FHŠ - Faculty of Humanities
FM - Faculty of Management
FTŠ Turistica - Turistica – College of Tourism Portorož
FVZ - Faculty of Health Sciences
IAM - Andrej Marušič Institute
PEF - Faculty of Education
UPR - University of Primorska
ZUP - University of Primorska Press
COBISS
University of Primorska, University Library - all departments
First page
/
Show document
Show document
A-
|
A+
|
Print
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
}
=
{
a
j
mod
n
,
a
k
mod
n
}
or
{
j
1
,
k
1
}
=
{
a
j
mod
n
,
−
a
k
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:
5530
Downloads:
139
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
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:
Searching for similar works...
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
,
j
1
,
k
1
)
izomorfna natanko takrat, ko obstaja celo število
a
tuje z
n
, za katerega velja, da drži bodisi
{
j
1
,
k
1
}
=
{
a
j
mod
n
,
a
k
mod
n
}
bodisi
{
j
1
,
k
1
}
=
{
a
j
mod
n
,
−
a
k
mod
n
}
. 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