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:
Hamiltonicity of vertex-transitive graphs of order 4p
Authors:
ID
Kutnar, Klavdija
(Author)
ID
Marušič, Dragan
(Author)
Files:
http://dx.doi.org/10.1016/j.ejc.2007.02.002
Language:
English
Work type:
Not categorized
Typology:
1.01 - Original Scientific Article
Organization:
IAM - Andrej Marušič Institute
Abstract:
It is shown that every connected vertex-transitive graph of order
4
p
, where
p
is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Hamilton path.
Keywords:
graph theory
,
vertex-transitive graphs
,
Hamilton cycle
,
automorphism group
Year of publishing:
2008
Number of pages:
str. 423-438
Numbering:
Vol. 29, iss. 2
PID:
20.500.12556/RUP-354
ISSN:
0195-6698
UDC:
519.17
COBISS.SI-ID:
2513111
Publication date in RUP:
15.10.2013
Views:
6382
Downloads:
42
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
:
KUTNAR, Klavdija and MARUŠIČ, Dragan, 2008, Hamiltonicity of vertex-transitive graphs of order 4p. [online]. 2008. Vol. 29, no. 2, p. 423–438. [Accessed 21 April 2025]. Retrieved from: http://dx.doi.org/10.1016/j.ejc.2007.02.002
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:
Similar works from our repository:
Rotary polygons in configurations
Automorphism groups of wreath product digraphs
Automorphism groups of Cayley digraphs of Zp3
Covering space techniques in graph theory
On generalized Cayley graphs
Similar works from other repositories:
GHG emissions reduction based on a heuristic optimization approach
The number of partitions of a non-negative integer
Direct products of complete graphs
Physical and logical redundancy in switched local area networks
Graphʼs theory approach for searching the shortest routing path in RIP protocol
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:
English
Keywords:
teorija grafov
,
tranzitivni grafi
,
Hamiltonov cikel
,
grupa avtomorfizmov
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back