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
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
HAMILTONSKA DOPOLNITEV GRAFA
Authors:
ID
Brodnjak, Nataša
(
Author
)
ID
Kovše, Matjaž
(
Mentor
)
More about this mentor...
Files:
UNI_Brodnjak_Natasa_2011.pdf
(486,63 KB)
MD5: D1098581F002172768B9245F98B2CA9B
PID:
20.500.12556/dkum/b1dee999-0ccf-41fc-907a-0e09b66a029a
Language:
Slovenian
Work type:
Undergraduate thesis
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
Diplomsko delo obravnava hamiltonsko dopolnitev grafa. Število hamiltonske dopolnitve grafa G je najmanjše število povezav, ki jih moramo dodati grafu, da ta postane hamiltonski graf. V prvem poglavju predstavimo osnovne definicije iz teorije grafov in algoritmov, ki jih potrebujemo v nadaljevanju. Nato definiramo problem hamiltonske dopolnitve grafa ter soroden problem pokrivanja vozlišč s potmi. V tretjem poglavju predstavimo algoritma za hamiltonsko dopolnitev dreves. V četrtem poglavju opišemo reševanje hamiltonske dopolnitve grafa za poljuben graf. Na koncu diplomskega dela opišemo sorodne probleme.
Keywords:
hamiltonski graf
,
hamiltonska dopolnitev grafa
,
pokrivanje s potmi
,
dodeljevanje frekvenc
Place of publishing:
Maribor
Publisher:
[N. Brodnjak]
Year of publishing:
2011
PID:
20.500.12556/DKUM-18995
UDC:
51(043.2)
COBISS.SI-ID:
18504456
NUK URN:
URN:SI:UM:DK:ZLBJ8EKJ
Publication date in DKUM:
07.07.2011
Views:
2390
Downloads:
146
Metadata:
Categories:
FNM
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
:
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.
Secondary language
Language:
English
Title:
HAMILTONIAN COMPLETION OF A GRAPH
Abstract:
The thesis is about the Hamiltonian completion of a graph G. We define the Hamiltonian completion number of a graph G, to be the minimum number of edges to be added to G in order to make it Hamiltonian. In the first chapter the basic defnitions from graph theory and algorithms, necessary for our purpose, are presented. Then the Hamiltonian completion problem and the similar problem of a path cover are defned. The third chapter is about the algorithms for the Hamiltonian completion for trees. In the fourth chapter the Hamiltonian completion problem for an arbitrary graph is considered. The thesis ends with a description of the problems, similar to the Hamiltonian completion problem.
Keywords:
Hamiltonian graph
,
Hamiltonian completion of a graph
,
path cover for a graph
,
frequency assignment
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
