| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Reševanje problemov z uporabo teorije grafov : na študijskem programu Predmetni učitelj
Authors:ID Verhnjak, Katarina (Author)
ID Dravec, Tanja (Mentor) More about this mentor... New window
Files:.pdf EMAG_Verhnjak_Katarina_2023.pdf (3,21 MB)
MD5: CFDB8E3692824445D8F0F223A133715E
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Pogosto vprašanje pri poučevanju matematike je njena aplikativnost v vsakdanjem življenju. Četudi magistrsko delo ni pedagoške narave, je sestavljeno tako, da se bralec na začetku pouči o teoriji grafov, tekom dela pa to teorijo pretvori v realne probleme. Prvi del magistrskega dela je povzetek najbolj pomembnih definicij in izrekov, brez katerih je razumevanje jezika teorije grafov nemogoče. Prikazani so zgledi družin grafov in dve posebni kategoriji grafov - Eulerjevi in Hamiltonovi grafi. Sledi uporabnost dreves, predvsem je poudarek posvečen vpetim drevesom in problemu iskanja najmanjšega vpetega drevesa v grafih. S tem znanjem lahko namreč načrtujemo optimalna železniška ali namakalna omrežja. Sledi poglavje povezanosti, kjer lahko prevedemo teorijo na problem konstrukcije zanesljivega komunikacijskega omrežja. Nazadnje pa je zbranih nekaj poljudnih nalog iz sklopa razvedrilne matematike za širši razpon bralcev, kjer lahko preverijo razumevanje teorije, saj le z njimi dvomljivcem v matematično uporabnost podamo odgovor.
Keywords:aplikacije teorije grafov, Eulerjevi grafi, Hamiltonovi grafi, drevesa, povezanost
Place of publishing:Maribor
Place of performance:Maribor
Publisher:[K. Verhnjak]
Year of publishing:2023
Number of pages:VIII, 60 str.
PID:20.500.12556/DKUM-83940 New window
UDC:519.172.1(043.2)
COBISS.SI-ID:150475779 New window
Publication date in DKUM:26.04.2023
Views:805
Downloads:74
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.

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:15.03.2023

Secondary language

Language:English
Title:Solving problems with graph theory : magistrsko delo
Abstract:One of the most common questions related to mathematics is it's applicability in solving day-to-day problems. Even though this particular master's dissertation is not of pedagogic nature, its structure allows the reader to initially learn about the graph theory and later on, convert the theory into real problems. In the first part of the thesis we present definitions and expressions, crucial to understanding the language and terminology of graph theory.We define some basic examples of graph families and present Eulerian and Hamiltonian graphs. Then we use trees to present the first application of graph theory and then focus to spanning trees and solving the connector problem. Using this knowledge, one can optimally design railway and irrigation systems, for example. The following chapter concerns graph connectivity and its applications in solving the problem of construction of reliable communication networks. We conclude the dissertation with a series of basics real world problems that can be solved by knowing just basics of graph theory.
Keywords:Applications of graph theory, Eulerian graphs, Hamiltonian graphs, trees, connectedness conectivity, application


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