| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Neodvisna dominacija na grafih
Authors:ID Črešnjevec, Nina (Author)
ID Dravec, Tanja (Mentor) More about this mentor... New window
Files:.pdf MAG_Cresnjevec_Nina_2017.pdf (1,30 MB)
MD5: A5971EA868BAB26C03C32777B5DCC728
PID: 20.500.12556/dkum/33d384db-7036-45f4-ab98-48d8888f7b68
 
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 obravnavamo različne tipe dominacij in sicer dominantno število, neodvisnostno število, neodvisno dominantno število in zgornje dominantno število. Neodvisno dominantno število je raziskano na različnih družinah grafov kot tudi na različnih grafovskih produktih. V prvem delu magistrske naloge smo navedli vse pojme, trditve, izreke, ki jih potrebujemo za razumevanje glavnega problema magistrske naloge. Predstavimo tudi različne razrede grafov in različne dominacije v grafih. V drugem poglavju obravnavamo različne meje neodvisnega dominantnega števila. Predstavljene so splošne meje, ki veljajo na različnih družinah grafov in meje, ki veljajo za dvodelne grafe. Tretje poglavje pa se nanaša na neodvisno dominantno število krepkega, korenskega in kartezičnega produkta. Za nekatere od teh produktov smo prikazali tudi rezultate o neodvisnostnem številu in dominantnem številu.
Keywords:dominantno število, neodvisno dominantno število, neodvisnostno število, dominantno popolni grafi, dobro pokriti grafi, grafovski produkti
Place of publishing:Maribor
Publisher:[N. Črešnjevec]
Year of publishing:2018
PID:20.500.12556/DKUM-68833 New window
UDC:519.17(043.2)
COBISS.SI-ID:23904008 New window
NUK URN:URN:SI:UM:DK:MOXIRGYZ
Publication date in DKUM:13.07.2018
Views:1285
Downloads:134
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:26.10.2017

Secondary language

Language:English
Title:Independent domination in graphs
Abstract:In this Master’s thesis, we discuss different invariants in domination theory. These are: domination number, independent domination number, independence number, upper domination number. We study independent domination number on different graph classes and devote one chapter to independent domination number of graph products. In the first part we list all necessary defnitions, claims and theorems that are needed in the rest of the thesis. We present and define different graph classes and different types of dominations. In the second part we present some bounds for independent domination number in general graphs and also in special graph classes such as bipartite graphs. In the third part we study independent domination number of strong product, rooted product and Cartesian product. For some of those graph products we present also the results on independence and domination number.
Keywords:domination number, independent domination number, independence number, domination perfect graphs, well-covered graphs, product graphs


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