Uporaba teorije grafov pri igrah in drugih realnih problemih

Ber, Matic

| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

First page > Show document

Show document

Title:	Uporaba teorije grafov pri igrah in drugih realnih problemih
Authors:	ID Ber, Matic (Author) ID Jakovac, Marko (Mentor) More about this mentor...
Files:	UN_Ber_Matic_2016.pdf (8,68 MB) MD5: 472ECD26FA0E0480DC97EF74EDE4FE0A
Language:	Slovenian
Work type:	Undergraduate thesis
Typology:	2.11 - Undergraduate Thesis
Organization:	FNM - Faculty of Natural Sciences and Mathematics
Abstract:	V diplomskem delu so opisane miselne igre, katerih rešitve lahko naravno podamo s pomočjo teorije grafov. Pogledamo nekaj najbolj znanih zagonetk in jih predstavimo v obliki dobro raziskanih ter znanih grafov. Ti med drugimi vključujejo polne dvodelne grafe, hiperkocke in zgodovinsko znan graf Königsbergških mostov. Vpeljemo možno posplošitev zagonetk na poljubno dimenzijo in podamo zmagovalno strategijo. V delu se podrobneje obravnavajo tudi določeni gospodarski problemi in uporaba teorije grafov v realnem svetu na različnih področjih kot so optimizacijski problemi, minimiziranje cene v ekonomiji, problemi v prometu in teoriji koristnosti. Postavimo vprašanje, ali ima izbran problem sprejemljivo rešitev in če je možno, predlagamo algoritem, ki privede do rešitve.
Keywords:	Teorija grafov, miselne igre, Eulerjevi grafi, Hamiltonovi grafi.
Place of publishing:	Maribor
Publisher:	[M. Ber]
Year of publishing:	2016
PID:	20.500.12556/DKUM-62481
UDC:	519.17(043.2)
COBISS.SI-ID:	22745864
NUK URN:	URN:SI:UM:DK:6SIVMLJM
Publication date in DKUM:	09.11.2016
Views:	1849
Downloads:	225
Metadata:
Categories:	FNM
:	BER, Matic, 2016, Uporaba teorije grafov pri igrah in drugih realnih problemih [online]. Bachelor’s thesis. Maribor : M. Ber. [Accessed 16 March 2025]. Retrieved from: https://dk.um.si/IzpisGradiva.php?lang=eng&id=62481 Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Similar works from our repository:

Many distances in planar graphs
Brešar, Boštjan: Partial Hamming graphs and expansion procedures. - Discrete Math. 237 (2001), no. 1-3, 13-27
Peterin, Iztok(SV-MAREE): A characterization of planar median graphs. (English summary). - Discuss. Math. Graph Theory 26 (2006), no. 1, 41--48.
Simić, Slobodan; Gutman, Ivan; Baltić, Vladimir: Some graphs with extremal Szeged index. - Math. Slovaca 50 (2000), no. 1, 1-15
Gravier, Sylvain: Total domination number of grid graphs. - Discrete Appl. Math. 121 (2002), no. 1-3, 119-128

Similar works from other repositories:

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:	Graph theory with applications in games and other real problems
Abstract:	In the following thesis we describe a set of playable mind games that lend themselves to an elegant transfiguring in the form of a graph. By means of graph theory, we are able to convert some of the most well-known brain teasers and re-imagine them as famous graphs. These among others include bipartite graphs, hypercubes and a historically famous Königsberg bridge graph. We provide the means of generalizing the aforementioned games to an arbitrary dimension, and also contribute a winning strategy in conceived situations. We take a closer look at the application of graph theory to solving real-world problems in fields ranging from route optimization, cost reductions, to tra c and utility related problems. If an e cient solution for a given problem exists, we suggest an algorithm that confers a solution.
Keywords:	Graph theory, puzzles, Eulerian graphs, Hamiltonian graphs.

Comments

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back