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:
Število mavrične povezanosti v grafu
Authors:
ID
Pišek, Jasmina
(Author)
ID
Peterin, Iztok
(Mentor)
More about this mentor...
Files:
UNI_Pisek_Jasmina_2011.pdf
(1000,32 KB)
MD5: 6C4D18C5DC2739B07F0510E582AD0B21
PID:
20.500.12556/dkum/4a991379-0927-403f-9326-0786f4057557
Language:
Slovenian
Work type:
Undergraduate thesis
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
Diplomska naloga obravnava števila mavrične in krepke mavrične povezanosti v grafih. Na začetku predstavimo osnovne pojme teorije grafov, ki so potrebni za razumevanje nadaljne snovi. V nalogo so vključena števila mavričnih in krepkih mavričnih barvanj za nekatere dobro znane grafe. Vključena so tudi števila mavrične povezanosti s predpisanimi vrednostmi. Konec pa vključuje mavrično in krepko mavrično barvanje krepkega in leksiografskega produkta.
Keywords:
graf
,
polni graf
,
polni dvodelni graf
,
cikel
,
kolesa
,
pot
,
drevo
,
barvanje povezav
,
(krepko) mavrično barvanje
,
število (krepkega) mavričnega barvanja
,
krepki produkt
,
leksiografski produkt
Place of publishing:
Maribor
Publisher:
[J. Pišek]
Year of publishing:
2011
PID:
20.500.12556/DKUM-21000
UDC:
51(043.2)
COBISS.SI-ID:
18720008
NUK URN:
URN:SI:UM:DK:UXFSN70U
Publication date in DKUM:
26.10.2011
Views:
2709
Downloads:
140
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
:
PIŠEK, Jasmina, 2011,
Število mavrične povezanosti v grafu
[online]. Bachelor’s thesis. Maribor : J. Pišek. [Accessed 7 April 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=21000
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:
Ozaveščenost mladostnic o raku materničnega vratu
Similar works from other repositories:
Stališča staršev do cepljenja proti humanem papiloma virusu
Analiza slovenskih spletnih informacij o cepljenju proti humanemu papiloma virusu
Osveščenost osnovnošolk o cepljenju proti okužbi s humanimi virusi papiloma
Zbornik
Rak materničnega vratu
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:
Rainbow connection in graphs
Abstract:
This thesis focuses on the rainbow connection number and strong rainbow connection number in the graph. We start by presenting the basic concepts of graph theory needed to understand the thesis. The task included the rainbow connection number and strong rainbow connection number of some well known graphs. The rainbow connection number with the prescribed values are also included. At the end we study rainbow connection number and strong rainbow connection number on strong and lexicographic product.
Keywords:
graph
,
complete graph
,
complete bipartite graph
,
cycle
,
wheels
,
path
,
tree
,
edge coloring
,
(strong) rainbow coloring
,
(strong) rainbow connection number
,
strong product
,
lexicographic product
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
