| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Odprto pakiranje povezav grafa : na študijskem programu 2. stopnje Izobraževalna matematika
Authors:ID Keše, Aleksandra (Author)
ID Dravec, Tanja (Mentor) More about this mentor... New window
Files:.pdf MAG_Kese_Aleksandra_2025.pdf (1,62 MB)
MD5: 93126F933B5ADF11F682BD9D02779D71
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:V magistrskem delu preučujemo lastnosti odprtega pakiranja povezav grafa. Za lažje razumevanje obravnavanega pojma najprej predstavimo osnovne pojme in rezultate iz teorije grafov ter opišemo osnovne družine grafov. V drugem delu magistrske naloge opišemo pojma odprto pakiranje povezav in povezavno odprto pakirno število ter ju predstavimo na osnovnih družinah grafov. Tretji del magistrske naloge je namenjen preučevanju mej za povezavno odprto pakirno število poljubnega grafa in identificiranju družin grafov, ki te meje dosežejo. V zadnjem delu magistrske naloge obravnavamo problem odprtega pakiranja povezav grafa kot NP-poln problem za grafe z univerzalnim vozliščem, Eulerjeve dvodelne grafe in ravninske grafe z maksimalno stopnjo največ 4. Opišemo postopek za izračun povezavnega odprtega pakirnega števila dreves in zapišemo, da obstaja algoritem, ki to število poišče v linearnem času.
Keywords:odprto pakiranje povezav, povezavno odprto pakirno število, drevo, časovna zahtevnost algoritma, NP-poln problem
Place of publishing:Maribor
Place of performance:Maribor
Publisher:[A. Keše]
Year of publishing:2025
Number of pages:VIII, 60 f.
PID:20.500.12556/DKUM-92869 New window
UDC:519.17(043.2)
COBISS.SI-ID:241649923 New window
Publication date in DKUM:07.07.2025
Views:217
Downloads:77
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:20.05.2025

Secondary language

Language:English
Title:Edge open packing sets in graphs : magistrsko delo
Abstract:In this thesis we study the properties of edge open packing sets in graphs. To facilitate the understanding of investigated concept, we first introduce fundamental concepts and results from graph Theory and describe basic graph families. We also explain the concept of algorithm complexity and NP-completeness. In the second part of the thesis we define the concepts of edge open packing set and edge open packing number of a graph and investigate the both concepts in special graph families. The third part is dedicated to studying the bounds for the edge open packing number and identifying graph families that achive these bounds. In the final part of the thesis we examine the problem of edge packing sets as an NP-complete problem for graphs with universal vertex, Eulerian bipartite graphs and planar graphs of maximum degree at most 4. We describe the procedure for computing the edge open packing number of trees and state that there exists an algorithm that finds said number in linear time.
Keywords:edge open packing set, edge open packing number, tree, time complexity of an algorithm, NP-complete problem


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