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
For students
For employees
Statistics
Login
First page
>
Show document
Show document
Title:
Vozliščno pokritje k-poti v grafih
Authors:
ID
Jesih, Igor
(Author)
ID
Jakovac, Marko
(Mentor)
More about this mentor...
Files:
UNI_Jesih_Igor_2013.pdf
(287,73 KB)
MD5: A0AA9A90E9B186A1434926B3C19A80A6
PID:
20.500.12556/dkum/0a66dd35-34ae-435b-9301-2395b3af7b3f
Language:
Slovenian
Work type:
Undergraduate thesis
Typology:
2.11 - Undergraduate Thesis
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
Diplomsko delo obravnava vozliščno pokritje k-poti v grafih. Na začetku so predstavljeni osnovni pojmi teorije grafov, ki so potrebni za razumevanje nadaljne snovi. V nalogo so vključeni pojmi NP-polnost, regularni grafi in drevesa. Konec pa vključuje vozliščna pokritja k-poti za nekatere grafovske produkte. Za velikost najmanjšega vozliščnega pokritja glede na stopnjo vozlišča bodo določene zgornje in spodnje meje grafa. Izboljšani bosta zgornja in spodnja ocena za najmanjše možno število vozlišč v pokritju k-poti pri kartezičnem, krepkem in leksikografskem produktu.
Keywords:
Vozliščno pokritje
,
NP-polnost
,
regularni graf
,
kartezični produkt
,
krepki produkt
,
leksikografski produkt.
Place of publishing:
Maribor
Publisher:
[I. Jesih]
Year of publishing:
2013
PID:
20.500.12556/DKUM-40050
UDC:
519.17(043.2)
COBISS.SI-ID:
19825928
NUK URN:
URN:SI:UM:DK:UEYOMKRE
Publication date in DKUM:
22.04.2013
Views:
2323
Downloads:
211
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
:
JESIH, Igor, 2013,
Vozliščno pokritje k-poti v grafih
[online]. Bachelor’s thesis. Maribor : I. Jesih. [Accessed 22 March 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=40050
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:
English
Title:
The k-path vertex cover of graphs
Abstract:
The diploma thesis deals with the k-path vertex cover of graphs. In the beginning, we will present the basic concepts of graph theory which are essential for further understanding of the subject. There are concepts of NP-completeness, regular graphs, and trees involved in the thesis. In the conclusion the k-path vertex cover of some graph products is determined. For the minimum k-path vertex cover we will determine some lower and upper bounds of graphs in respect to its degree. Lower and upper bounds for the minimum k-path vertex cover of the Cartesian product, the strong product, and the lexicographic product will also be improved.
Keywords:
Vertex cover
,
NP-completeness
,
regular graphs
,
the Cartesian product
,
the strong product
,
the lexicographic product.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
