| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:DINAMIČNO BARVANJE GRAFOV
Authors:Grahornik, Tjaša (Author)
Jakovac, Marko (Mentor) More about this mentor... New window
Files:.pdf UNI_Grahornik_Tjasa_2012.pdf (586,39 KB)
 
Language:Slovenian
Work type:Undergraduate thesis (m5)
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
Year of publishing:2012
Publisher:[T. Grahornik]
Source:Maribor
UDC:51(043.2)
COBISS_ID:19411976 Link is opened in a new window
NUK URN:URN:SI:UM:DK:QBZ47XKH
Views:1093
Downloads:113
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:FNM
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

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 have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica