| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Spletna aplikacija za 4-tlakovanja benzenoidnih grafov
Authors:ID Pačnik, Matija (Author)
ID Vesel, Aleksander (Mentor) More about this mentor... New window
Files:.pdf UN_Pacnik_Matija_2014.pdf (1,59 MB)
MD5: 6918ED27243A957CE49860108D68958A
 
Language:Slovenian
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:PEF - Faculty of Education
Abstract:V diplomskem delu je predstavljen algoritem, ki poišče 4–tlakovanje elementarnega benzenoidnega grafa v linearnem času. Najprej so predstavljeni osnovni pojmi in definicije elementarnih benzenoidnih grafov. Pokazano je, da periferni 1–faktor elementarnega benzenoidnega grafa G inducira 4–tlakovanje od G. Predstavljen je algoritem MSH, ki poišče 1–faktor v linearnem času. Sledi razlaga algoritma RFD, ki se uporabi za dekompozicijo reducibilnih lic elementarnega benzenoidnega grafa. Delovanje obeh algoritmov je prikazano na primerih. V zadnjem poglavju so predstavljene programske rešitve, ki so bile uporabljene pri izdelavi spletne aplikacije in njeno delovanje na primerih različnih grafov.
Keywords:benzenoidni graf, 1–faktor, 4–tlakovanje, algoritem RFD, reducibilni šestkotniki, dekompozicija reducibilnih lic
Place of publishing:Maribor
Publisher:[M. Pačnik]
Year of publishing:2014
PID:20.500.12556/DKUM-46971 New window
UDC:519.17(043.2)
COBISS.SI-ID:21025800 New window
NUK URN:URN:SI:UM:DK:KADQGGAZ
Publication date in DKUM:23.12.2014
Views:1693
Downloads:113
Metadata:XML DC-XML DC-RDF
Categories:PEF
:
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:Web application for 4-tilings of benzenoid graphs
Abstract:In this graduation thesis we present an algorithm that finds a 4–tiling of an elementary benzenoid graphs in linear time. First, we present basic terms and definitions of elementary benzenoid graphs. It is shown that a peripheral 1–factor of elementary benzenoid graph G induces 4–tilings of G. We present algorithm MSH, which finds 1–factor in linear time. Later we explain algorithm RFD which is used for reducible face decomposition of an elementary benzenoid graph. The running of both algorithms is shown by examples. The last chapter covers the software solutions that have been used in making of web application with detailed explanation by examples.
Keywords:benzenoid graphs, 1–factor, 4–tiling, algorithm RFD, reducible hexagons, reducible face decomposition


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