| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Distributivna mreža na množici popolnih prirejanj ravninskega dvodelnega grafa
Authors:ID Trbovc, Mateja (Author)
ID Žigert Pleteršek, Petra (Mentor) More about this mentor... New window
Files:.pdf UN_Trbovc_Mateja_2015.pdf (942,17 KB)
MD5: E8CBCD2604FCFE87486B44FFF2FC435A
 
Language:Slovenian
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Glavna tema diplomskega dela je, kako priti do distributivne mreže na množici popolnih prirejanj, ravninskega dvodelnega grafa. V drugem poglavju spoznamo osnovne lastnosti grafov. Posebej se poglobimo v dvodelne ravninske grafe. Spomnimo se pojma urejenosti. Izpostavimo pojma delno urejena množica in distributivna mreža. Vse to potrebujemo v nadaljevanju diplomskega dela. Bistvo diplome se začne v tretjem poglavju, kjer definiramo resonančne grafe R(G) in usmerjene resonančne grafe ali digrafe R(G). Za vpeljavo le-teh moramo definirati popolno prirejanje oziroma 1-faktorje ter simetrično razliko med njimi. V četrtem poglavju govorimo o enotski dekompoziciji, kjer podrobneje spoznamo dekompozicijo gozda in ravnine. V predzadnjem poglavju vpeljemo delno urejeno množico kot množico popolnih prirejanj. Za konec sledi rezultat, o tem kako s pomočjo delno urejene množice M(G) in distributivne mreže pridemo do Hassejevega diagrama za končne distributivne mreže. Ta pa je v bijektivnem odnosu z resonančnim digrafom. Torej je distributivna mreža rezultat povezave resonančnih grafov in urejenosti
Keywords:distributivna mreža, delno urejena množica, popolno prirejanje, Z-transformirani graf, ravninski dvodelen graf, Hassejev diagram, povezani graf, dvodelni graf, ravninski graf, drevo, gozd
Place of publishing:Maribor
Publisher:[M. Trbovc Rebernak]
Year of publishing:2015
PID:20.500.12556/DKUM-48277 New window
UDC:519.172.2(043.2)
COBISS.SI-ID:22109192 New window
NUK URN:URN:SI:UM:DK:BYNNT5ZE
Publication date in DKUM:21.04.2016
Views:1846
Downloads:193
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:A distributive lattice on the set of perfect matchings of a plane bipartite graph
Abstract:Main theme of this diploma work is how to get the distributive lattice on the set of perfect matchings of a planar bipartite graph G. In the second chapter we get to know the basic properties of graphs, especially about planar bipartite graphs. We remember the concept of ordered sets, especially about partially ordered ser and distributive lattice. These are all concepts needed through the diploma thesis. The main part of the diplomas is in the third chapter, where we define the resonance graph R(G) and the directed resonance graph or digraph. For the introduction of these we need to define the set of perfect matchings M(G) t.i. 1-factors of G and the symmetric difference between them. In the fourth chapter we talk about the unit decomposition and further about the decomposition of a forest in a plane. In the penultimate chapter we introduce the set of perfect matching M(G) as a partially ordered set and introduce its Hasse diagram which is in a bijective relationship with the resonance digraph. So distributive lattice on M(G) is a result of the connection between the resonance graphs and order sets.
Keywords:distributive lattice, partially ordered set, poset, forest poset, perfect matching, Z-transformation graphs, planar bipartite graph, Hasse diagram, connected graph, bipartite graph, planar graph, tree, forest.


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