| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Nekatere posplošitve grafov Sierpińskega
Authors:ID Šereg, Andreja (Author)
ID Jakovac, Marko (Mentor) More about this mentor... New window
Files:.pdf UNI_Sereg_Andreja_2013.pdf (5,07 MB)
MD5: 024B423EBD97A2651D5BEF17BC82EE82
 
Language:Slovenian
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V diplomskem delu so predstavljeni grafi Sierpińskijevega tipa, in sicer grafi Sierpińskega S(n, k), grafi trikotnikov Sierpińskega S_n, regularni grafi Sierpińskega S^+(n, k) in S^++(n, k) ter posplošeni grafi trikotnikov Sierpińskega S[n, k]. Prikazane so natančne risbe grafov S(n, k), S^+(n, k) in S^++(n, k). Za S^+(n, k) in S^++(n, k) je dokazano, da so te risbe optimalne. Določeno je število po povezavah disjunktnih Hamiltonovih poti in Hamiltonovih ciklov v grafih S(n, k), S^+(n, k) in S^++(n, k). Dokazano je, da so grafi S[n, k] Hamiltonovi. Raziskana je vozliščna linearna pogozdenost grafov S(n, k), S^+(n, k), S^++(n, k) in S[n, k]. Podano je še {P_r}-prosto kromatično število grafov S_n, S(n, k), S^+(n, k) in S^++(n, k), za r ∈ {3, 4}.
Keywords:graf Sierpińskega, graf trikotnikov Sierpińskega, regularni graf Sierpińskega, posplošeni graf trikotnikov Sierpińskega, prekrižno število, hamiltonskost, t-barvanje poti, vozliščna linearna pogozdenost, {P_r}-prosto kromatično število
Place of publishing:Maribor
Publisher:[A. Šereg]
Year of publishing:2013
PID:20.500.12556/DKUM-41369 New window
UDC:51(043.2)
COBISS.SI-ID:20061448 New window
NUK URN:URN:SI:UM:DK:MS0JYVTX
Publication date in DKUM:19.09.2013
Views:2016
Downloads:139
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:Some generalizations of Sierpiński graphs
Abstract:In this graduation thesis Sierpiński-like graphs, namely Sierpiński graphs S(n, k), Sierpiński gasket graphs S_n, regular Sierpiński graphs S^+(n, k) and S^++(n, k) and generalized Sierpiński gasket graphs S[n, k] are presented. Explicit drawings of graphs S(n, k), S^+(n, k) and S^++(n, k) are shown and proved to be optimal for S^+(n, k) and S^++(n, k). The numbers of edge disjoint Hamiltonian paths and Hamiltonian cycles in S(n, k), S^+(n, k) and S^++(n, k) are determined. Graphs S[n, k] are proven to be Hamiltonian. Vertex linear arboricity of S(n, k), S^+(n, k), S^++(n, k) and S[n, k] is studied. {Pr}-free cromatic number of S_n, S(n, k), S^+(n, k) and S^++(n, k) for r ∈ {3, 4} is given.
Keywords:Sierpiński graph, Sierpiński gasket graph, regular Sierpiński graph, generalized Sierpiński gasket graph, crossing number, Hamiltonicity, path t-coloring, vertex linear arboricity, {P_r}-free 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