Hamiltonovi grafovi
U ovom diplomskom radu smo proučavali pojam Hamiltonovog ciklusa. Definirali smo osnovne pojmove korištene u teoriji grafova te pojmove zatvorenja i žilavosti grafa. Obradili smo nužne i dovoljne uvjete koji nam olakšavaju pronalazak Hamiltonovog ciklusa u grafu. Sve definirane pojmove smo potkrijep...
Main Author: | |
---|---|
Other Authors: | |
Format: | Master Thesis |
Language: | Croatian |
Published: |
Sveučilište u Splitu. Prirodoslovno-matematički fakultet. Odjel za matematiku.
2021
|
Subjects: | |
Online Access: | https://zir.nsk.hr/islandora/object/pmfst:1325 https://urn.nsk.hr/urn:nbn:hr:166:631985 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1325 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1325/datastream/PDF |
id |
ftnulzagrebzir:oai:zir.nsk.hr:pmfst_1325 |
---|---|
record_format |
openpolar |
spelling |
ftnulzagrebzir:oai:zir.nsk.hr:pmfst_1325 2023-08-27T04:11:47+02:00 Hamiltonovi grafovi Hamiltonian graphs Šegvić, Bruno Vojković, Tanja 2021-09-29 application/pdf https://zir.nsk.hr/islandora/object/pmfst:1325 https://urn.nsk.hr/urn:nbn:hr:166:631985 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1325 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1325/datastream/PDF hrv hrv Sveučilište u Splitu. Prirodoslovno-matematički fakultet. Odjel za matematiku. University of Split. University of Split, Faculty of science. Department of Mathematics. https://zir.nsk.hr/islandora/object/pmfst:1325 https://urn.nsk.hr/urn:nbn:hr:166:631985 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1325 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1325/datastream/PDF http://rightsstatements.org/vocab/InC/1.0/ info:eu-repo/semantics/openAccess grafovi Hamiltonovi grafovi zatvorenje grafa žilavost grafa graphs Hamiltonian graphs closure of graph toughness of graph PRIRODNE ZNANOSTI. Matematika NATURAL SCIENCES. Mathematics info:eu-repo/semantics/masterThesis text 2021 ftnulzagrebzir 2023-08-03T17:44:48Z U ovom diplomskom radu smo proučavali pojam Hamiltonovog ciklusa. Definirali smo osnovne pojmove korištene u teoriji grafova te pojmove zatvorenja i žilavosti grafa. Obradili smo nužne i dovoljne uvjete koji nam olakšavaju pronalazak Hamiltonovog ciklusa u grafu. Sve definirane pojmove smo potkrijepili primjerima kako bi si vizualizirali sami pojam. In this master’s thesis we have been studying Hamiltonian cycles in graphs. We defined basic terms used in graph theory and terms of closure and toughness of graph. We processed sufficient and neccessary conditions for Hamiltonicity. We have supported all the defined concepts with examples in order to better visualize the concept itself. Master Thesis sami Croatian Digital Theses Repository (National and University Library in Zagreb) |
institution |
Open Polar |
collection |
Croatian Digital Theses Repository (National and University Library in Zagreb) |
op_collection_id |
ftnulzagrebzir |
language |
Croatian |
topic |
grafovi Hamiltonovi grafovi zatvorenje grafa žilavost grafa graphs Hamiltonian graphs closure of graph toughness of graph PRIRODNE ZNANOSTI. Matematika NATURAL SCIENCES. Mathematics |
spellingShingle |
grafovi Hamiltonovi grafovi zatvorenje grafa žilavost grafa graphs Hamiltonian graphs closure of graph toughness of graph PRIRODNE ZNANOSTI. Matematika NATURAL SCIENCES. Mathematics Šegvić, Bruno Hamiltonovi grafovi |
topic_facet |
grafovi Hamiltonovi grafovi zatvorenje grafa žilavost grafa graphs Hamiltonian graphs closure of graph toughness of graph PRIRODNE ZNANOSTI. Matematika NATURAL SCIENCES. Mathematics |
description |
U ovom diplomskom radu smo proučavali pojam Hamiltonovog ciklusa. Definirali smo osnovne pojmove korištene u teoriji grafova te pojmove zatvorenja i žilavosti grafa. Obradili smo nužne i dovoljne uvjete koji nam olakšavaju pronalazak Hamiltonovog ciklusa u grafu. Sve definirane pojmove smo potkrijepili primjerima kako bi si vizualizirali sami pojam. In this master’s thesis we have been studying Hamiltonian cycles in graphs. We defined basic terms used in graph theory and terms of closure and toughness of graph. We processed sufficient and neccessary conditions for Hamiltonicity. We have supported all the defined concepts with examples in order to better visualize the concept itself. |
author2 |
Vojković, Tanja |
format |
Master Thesis |
author |
Šegvić, Bruno |
author_facet |
Šegvić, Bruno |
author_sort |
Šegvić, Bruno |
title |
Hamiltonovi grafovi |
title_short |
Hamiltonovi grafovi |
title_full |
Hamiltonovi grafovi |
title_fullStr |
Hamiltonovi grafovi |
title_full_unstemmed |
Hamiltonovi grafovi |
title_sort |
hamiltonovi grafovi |
publisher |
Sveučilište u Splitu. Prirodoslovno-matematički fakultet. Odjel za matematiku. |
publishDate |
2021 |
url |
https://zir.nsk.hr/islandora/object/pmfst:1325 https://urn.nsk.hr/urn:nbn:hr:166:631985 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1325 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1325/datastream/PDF |
genre |
sami |
genre_facet |
sami |
op_relation |
https://zir.nsk.hr/islandora/object/pmfst:1325 https://urn.nsk.hr/urn:nbn:hr:166:631985 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1325 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1325/datastream/PDF |
op_rights |
http://rightsstatements.org/vocab/InC/1.0/ info:eu-repo/semantics/openAccess |
_version_ |
1775354901730164736 |