| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:(d, n)-pakirno barvanje za posplošene grafe Sierpińskega : magistrsko delo
Authors:ID Jeromel, Anže (Author)
ID Korže, Danilo (Mentor) More about this mentor... New window
ID Vesel, Aleksander (Comentor)
Files:.pdf MAG_Jeromel_Anze_2019.pdf (4,27 MB)
MD5: A11296A0C3B4B3FC26375A3AEB472549
PID: 20.500.12556/dkum/66f0c042-3c11-4dbc-8410-314b2f909a19
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V magistrski nalogi so opisani grafi Sierpińskega in njihove posplošitve, (d, n)-pakirno barvanje grafov ter računsko iskanje (d, n)-pakirnih kromatičnih števil. Razvili smo algoritem za generiranje grafov Sierpińskega z osnovo 4 ter implementirali štiri metode barvanja grafov. Našli smo točna (d, n)-pakirna kromatična števila za različne kombinacije (d, n) pri grafih stopnje 2, pri grafih višjih stopenj pa njihove zgornje meje. Prav tako smo našli točna (1, 1)-pakirna kromatična števila dveh izbranih posplošenih grafov Sierpińskega do vključno stopnje 5.
Keywords:Sierpiński, pakirno barvanje, pakirno kromatično število
Place of publishing:Maribor
Place of performance:Maribor
Publisher:A. Jeromel
Year of publishing:2019
Number of pages:VI, 47 str.
PID:20.500.12556/DKUM-73544 New window
UDC:004.94:004.83(043.2)
URN:URN:SI:UM:DK:GOCCARB2
COBISS.SI-ID:22488342 New window
NUK URN:URN:SI:UM:DK:GOCCARB2
Publication date in DKUM:04.06.2019
Views:1727
Downloads:137
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
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.

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:13.05.2019

Secondary language

Language:English
Title:(d, n)-packing coloring of generalized Sierpiński graphs
Abstract:In our work we describe Sierpiński graphs, their generalizations, (d, n)-packing coloring of graphs and computing their (d, n)-packing chromatic numbers. We developed an algorithm that generates Sierpinski graphs with base 4 and implemented four methods for coloring graphs. We found the exact (d, n)-packing chromatic numbers for different combinations of (d, n) for graphs of dimension 2, and found their upper bounds for graphs of higher dimensions. We also found the exact (1, 1)-packing chromatic numbers for two generalized Sierpiński graphs up to and including dimension 5.
Keywords:Sierpiński, packing coloring, packing chromatic number


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