magistrsko delo
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;magistrske naloge;
Data
Language: |
Slovenian |
Year of publishing: |
2019 |
Typology: |
2.09 - Master's Thesis |
Organization: |
UM FERI - Faculty of Electrical Engineering and Computer Science |
Publisher: |
A. Jeromel |
UDC: |
004.94:004.83(043.2) |
COBISS: |
22488342
|
Views: |
762 |
Downloads: |
64 |
Average score: |
0 (0 votes) |
Metadata: |
|
Other data
Secondary language: |
English |
Secondary title: |
(d, n)-packing coloring of generalized Sierpiński graphs |
Secondary 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. |
Secondary keywords: |
Sierpiński;packing coloring;packing chromatic number; |
URN: |
URN:SI:UM:DK:GOCCARB2 |
Type (COBISS): |
Master's thesis/paper |
Thesis comment: |
Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije |
Pages: |
VI, 47 str. |
ID: |
11136214 |