| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:K-geodominantne množice v grafih in sorodni koncepti
Authors:ID Kotnik, Katja (Author)
ID Tepeh, Aleksandra (Mentor) More about this mentor... New window
Files:.pdf UN_Kotnik_Katja_2016.pdf (1,34 MB)
MD5: 03FF0141FBC2FA2D610AE442C06F9C44
 
Language:Slovenian
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Množica vozlišč S grafa Г je geodominantna množica, če poljubno vozlišče grafa Г leži na vsaj enem intervalu med vozliščema iz S. Za naravno število k je vozlišče v k-geodominirano z vozliščema x,y∈V(Г), če v leži na neki najkrajši poti dolžine k med vozliščema x in y. Podmnožica S⊆V(Г) je k-geodominantna množica, če je vsako vozlišče v∈V(Г) S k-geodominirano z nekim parom vozlišč iz S. Množica vozlišč v grafu je neodvisna, če nobeni dve vozlišči iz te množice nista povezani. Neodvisna množica, ki je (k"-" )geodominantna, se imenuje neodvisna (k"-" )geodominantna množica grafa Г. Dominantna množica grafa Г je taka podmnožica D⊆V(Г), da je vsako vozlišče, ki ni v D, sosedno z vsaj enim vozliščem iz D. Diplomsko delo obravnava zveze med geodominantnimi, k-geodominantnimi, dominantnimi in neodvisnimi množicami v poljubnih grafih. Podane so nekatere lastnosti geodominantnih množic v povezavnih grafih in kartezičnih produktih. Prav tako so obravnavane lastnosti neodvisnih geodominantnih in neodvisnih k-geodominantnih množic.
Keywords:geodominantna množica, k-geodominantna množica, totalna k-geodominantna množica, neodvisna geodominantna množica, neodvisna k-geodominantna množica.
Place of publishing:Maribor
Publisher:[K. Kotnik]
Year of publishing:2016
PID:20.500.12556/DKUM-59473 New window
UDC:519.17(043.2)
COBISS.SI-ID:22503176 New window
NUK URN:URN:SI:UM:DK:RHZOKUWN
Publication date in DKUM:08.09.2016
Views:1504
Downloads:117
Metadata:XML DC-XML DC-RDF
Categories:FF
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.

Secondary language

Language:English
Title:K-geodominating sets in graphs and related concepts
Abstract:A set S of vertices of a graph Г is a geodominating set if every vertex of Г lies in at least one interval between the vertices of S. For an integer k≥1, a vertex v is k-geodominated by a pair x,y∈V(Г) if v lies on a shortest path of length k between vertices x and y. A subset S⊆V(Г) is a k-geodominating set if each vertex v∈V(Г) S is k-geodominated by some pair of vertices of S. An independent set is a set of vertices in a graph, no two of which are adjacent. An independent set of in Г that is a (k-)geodominating set of Г is called an independent (k-)geodominating set of Г. A dominating set for a graph Г is a subset D⊆V(Г) such that every vertex not in D is adjacent to at least one member of D. The graduation thesis investigates relationships between geodominating, k-geodominating sets, dominating sets and independent sets in arbitrary graphs. Some properties of geodominating sets in line graphs and Cartesian products are given. Also, independent geodominating sets and independent k-geodominating sets are studied.
Keywords:geodominating set, k-geodominating set, total k-geodominating set, independent geodominating set, independent k-geodominating set.


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