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:
DINAMIČNO BARVANJE GRAFOV
Authors:
ID
Grahornik, Tjaša
(
Author
)
ID
Jakovac, Marko
(
Mentor
)
More about this mentor...
Files:
UNI_Grahornik_Tjasa_2012.pdf
(586,39 KB)
MD5: 9A5DB82D5C485CF588C16F5E8BE6140D
PID:
20.500.12556/dkum/9e903ef9-e37f-4314-80cb-1bcdddac40b0
Language:
Slovenian
Work type:
Undergraduate thesis
Typology:
2.11 - Undergraduate Thesis
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
V diplomskem delu je predstavljeno dinamično barvanje grafov. V uvodnih poglavjih so predstavljeni osnovni pojmi iz teorije grafov, ki so pomembni za razumevanje diplomskega dela. Pogledali si bomo kakšno je dinamično kromatično število za polne grafe, drevesa in cikle. V nalogi so opisane znane zgornje meje za dinamično kromatično število. Primerjali smo kromatično število in dinamično kromatično število za normalne grafe in regularne grafe. Ugotovili smo, da je razlika med dinamičnim kromatičnim številom in kromatičnim številom poljubno velika za nekatere grafe. Del diplomske naloge bomo posvetili tudi dinamičnemu barvanju kartezičnega produkta dveh grafov ter zaključili s posplošitvijo dinamičnega barvanja.
Keywords:
dinamično barvanje grafov
,
zgornje meje
,
kartezični produkt
,
posplošitev dinamičnega barvanja
Place of publishing:
Maribor
Publisher:
[T. Grahornik]
Year of publishing:
2012
PID:
20.500.12556/DKUM-38556
UDC:
51(043.2)
COBISS.SI-ID:
19411976
NUK URN:
URN:SI:UM:DK:QBZ47XKH
Publication date in DKUM:
11.10.2012
Views:
1994
Downloads:
157
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:
DYNAMIC COLORING OF GRAPHS
Abstract:
The graduation thesis presents the dynamic coloring of graphs. In the first chapter we present basic concepts of graph theory, which are important for understanding the thesis. We will determine the dynamic chromatic number for complete graphs, trees and cycles. The thesis describes the known upper bounds for the dynamic chromatic number. We compared the chromatic number and the dynamic chromatic number for normal and regular graphs. We found out that the difference between the dynamic chromatic number and the chromatic number is arbitrarily large for some graphs. Part of the thesis will be about dynamic chromatic number of the Cartesian product of two graphs and we will conclude with a generalization of dynamic coloring of graphs.
Keywords:
dynamic coloring of graphs
,
upper bounds
,
The Cartesian product
,
a generalization of dynamic coloring
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
