| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Celotno kromatično število regularnih grafov z visoko stopnjo vozlišč
Authors:ID Prašnički, Lidija (Author)
ID Jakovac, Marko (Mentor) More about this mentor... New window
Files:.pdf MAG_Prasnicki_Lidija_2015.pdf (744,11 KB)
MD5: 052E74EB511F1BF63BD622A2820F607C
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V magistrskem delu je obravnavano celotno kromatično število regularnih grafov z visoko stopnjo vozlišč. Celotno kromatično število grafa je najmanjše število barv, ki jih potrebujemo, da pobarvamo vozlišča in povezave grafa tako, da sosednja ali incidentna elementa nimata enakih barv. Behzad-Vizingova domneva nam poda spodnjo in zgornjo mejo za celotno kromatično število. V magistrskem delu dokažemo, da regularni grafi, ki izpolnjujejo določene pogoje povezane s stopnjo grafa, zadoščajo tej domnevi. V prvem poglavju so definirani nekateri pojmi in navedeni pomembni rezultati iz teorije grafov, ki jih potrebujemo v nadaljevanju. V drugem poglavju so obravnavani grafi sodega reda z visoko stopnjo vozlišč. Najprej so podani pomembni rezultati za poljubne grafe, potem pa je v drugem podpoglavju dokazano, da regularni graf sodega reda z visoko stopnjo vozlišč, ki izpolnjuje določen pogoj, zadošča Behzad-Vizingovi domnevi. V tretjem poglavju so podobno obravnavani tudi poljubni in regularni grafi lihega reda z visoko stopnjo vozlišč.
Keywords:celotno kromatično število, regularni graf, prirejanje grafa
Place of publishing:Maribor
Publisher:[L. Prašnički]
Year of publishing:2015
PID:20.500.12556/DKUM-47567-b4c17b5a-e215-c619-2087-67e8e736b689 New window
UDC:519.17(043.2)
COBISS.SI-ID:21251592 New window
NUK URN:URN:SI:UM:DK:PRYFVOBS
Publication date in DKUM:23.03.2015
Views:2190
Downloads:159
Metadata:XML DC-XML DC-RDF
Categories:FNM
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and 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:The total chromatic number of regular graphs with high vertex degree
Abstract:The master's thesis deals with the total chromatic number of regular graphs with high vertex degree. The total chromatic number of a graph is the minimum number of colours that we need to colour the vertices and edges of a graph, in which the adjacent or incident elements are not of the same colour. The Behzad-Vizing conjecture gives the lower and upper bound for the total chromatic number. It is proved that the graphs that satisfy certain conditions related to the degree of graph satisfy this conjecture. In the first chapter some concepts are defined and relevant results from graph theory are mentioned which are needed hereinafter. In the second chapter, the graphs of even order with high vertex degree are discussed. First, results for general graphs are given and later it is proved that the Behzad-Vizing conjecture holds for regular graphs of even order and high degree, that meet certain conditions. The same is done in the third chapter for general and regular graphs of odd order and high vertex degree.
Keywords:the total chromatic number, regular graph, graph matching


Comments

Leave comment

You must 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