125 research outputs found
Connected partition dimension of graphs
Get PDFDiplomsko delo obravnava povezano particijsko dimenzijo grafov. Tvorijo ga tri poglavja. V prvem poglavju so predstavljeni osnovni pojmi, definicije in primeri iz teorije grafov. Drugo poglavje je namenjeno predstavitvi povezane particijske dimenzije grafov in njenih lastnosti. Obravnavana je povezava med particijsko dimenzijo in povezano particijsko dimenzijo grafov. Podana je karakterizacija grafov reda n, katerih povezana particijska dimenzija je enaka 2, n ali n-1. V tretjem poglavju je določena povezana particijska dimenzija dreves, koles in Jahangirovih grafov. Poleg tega je dokazan izrek, ki pravi, da za vsak par celih števil a in b, kjer je a večje ali enako 3 in b manjše ali enako 2a-1 in hkrati večje od a, obstaja povezan graf G, da je pd(G)=a in cpd(G)=b.The diploma paper deals with the connected partition dimension of graphs. It consists of three chapters. The first chapter presents the basic concepts, definitions and examples from the graph theory. The second chapter presents connected partition dimension of graphs and its properties. It deals with the relationship between the partition dimension of graphs and the connected partition dimension of graphs. The characterization of graphs of order n, for which the connected partition dimension is equal to 2, n or n – 1 is given. In the third chapter, the connected partition dimension of trees, wheels and Jahangir graphs is determined. Moreover, the proof of the theorem which states that for every pair of integers a and b, with a greater than or equal to 3 and b less than or equal to 2a-1 and b greater than a, there is a connected graph G having pd(G)=a and cpd(G)=b is given
GRAPH PEGGING NUMBER
Get PDFDiplomsko nalogo tvori šest poglavij. Po uvodu sledi poglavje z osnovnimi pojmi teorije grafov, ki so uporabljeni v diplomski nalogi.
V drugem poglavju so predstavljene osnovne lastnosti igre s palicami ter definirani pojmi palično število, optimalno palično število, palična poteza, dvopalična poteza, odstranitvena poteza, razporeditev na grafu, dobra (multi) razporeditev na grafu, cilj poteze in izid razporeditve.
V tretjem poglavju sta podana palično in optimalno palično število poti, ciklov in spojev grafov. Prikazani so tudi primeri razporeditve za nekatere poti in cikle manjšega reda.
V četrtem poglavju sta podani palično in optimalno palično število kartezičnega produkta polnih grafov ter določeni spodnja in zgornja meja paličnega števila kartezičnega produkta , ki temelji na dvopaličnem številu.
V petem poglavju je določeno palično število hiperkock. Poleg tega sta določeni še spodnja in zgornja meja za optimalno palično število hiperkock.
V šestem poglavju pa so določene spodnje in zgornje meje za palično in optimalno palično število grafov z majhnim premerom.The graduation thesis consists of six sections. After introduction the basic concepts of the Graph Theory used in the thesis are presented.
In the second section the basic properties of pegging are introduced and the definitions of pegging number, optimal pegging number, pegging move, pebbling move, removal move, distribution on a graph, proper(multi) distribution on a graph, target vertex and reach of a distribution are given.
In the third section the pegging and the optimal pegging number of paths, cycles and joins are given and some examples of distributions for paths and cycles of small order are presented.
In the fourth section the pegging and the optimal pegging number of the Cartesian product of complete graphs are determined. Moreover, the lower and the upper bound for the pegging number of the Cartesian product , which are based on the pebbling number, are established.
In the fifth section the pegging number of the hypercubes and also the lower and the upper bound for the optimal pegging number of the hypercubes are determined.
In the sixth section the lower and the upper bound for the pegging and the optimal pegging number of graphs of small diameter are presented
The influence of digital transformation and process optimization on motivation and satisfaction of household appliance servicers
Get PDFV magistrski nalogi obravnavamo obremenjenost serviserjev, ki se iz leta v leto povečuje, vedno bolj je v poslovnih in proizvodnih procesih prisotna umetna inteligenca. V prvem delu smo poleg organizacijske klime predstavili teoretična izhodišča za obremenjenost, motivacijo in zadovoljstvo zaposlenih na delovnem mestu serviserja podjetja Gorenja. Pozornost smo namenili tudi interakciji med človekom in strojem, kjer smo na podlagi Maverick raziskave lahko dobili vpogled, na kakšen način bi umetna inteligenca sodelovala s človekom. Ob tem smo zastavili vprašanje, kje je pravzaprav meja, ko je umetna inteligenca prispevek v življenju človeka, in kdaj je meja prekoračena.In this master thesis, we look at the workload of service technicians is increasing from year by year, and artificial intelligence is becoming more and more prevalent in business and production processes. In the first part, in addition to the organizational climate, we presented the theoretical basis for workload, motivation and employee satisfaction of Gorenje’s service technicians. We also focused on human-machine interaction, where we were able to gain insights from Maverick\u27s research into how AI could interact with humans. We put the question, where the line is actually drawn when AI can make a contribution to human life, and when it is crossed
Hat games
Get PDFV diplomskem delu sta najprej predstavljeni dve osnovni igri s klobuki, in sicer Ebertova igra s klobuki in igra s klobuki v vrsti ter njune različice skupaj z rešitvami. Obe igri sta igri enega ali več igralcev, pri kateri morajo igralci na podlagi informacij o barvah soigralčevih klobukov, ugotoviti barvo svojega klobuka. V nadaljevanju sledi obravnava Nove igre s klobuki v vrsti, ki je kombinacija obeh prej omenjenih iger. Pri tej igri je obravnavana tudi optimalna strategija igre, katere dokaz temelji na kombinatoričnih situacijah.
V zadnjem delu je kot zanimivost predstavljen še drugačen pristop k igri z uporabo teorije grafov, oziroma natančneje, z uporabo hiperkock.Two basic hat games - Ebert\u27s Hat Game and Hats-on-a-line Game with its variations and solutions are presented in the first part of diploma thesis. Both are inteaded for one or more players where each has to guess the colour of own hat based only on the information about hat colours of co-players.
Furthermore, the New Hats-on-a-line Game is the combination of both previously mentioned game. The optimal strategy of the game whose proof is grounded on combinatorial situations is dealt with that game.
An interesting fact in the last part is a different approach to the game using graph theory or more precisely, using hypercubes
Maria Rita Leto, Il capolavoro imperfetto. Forme narrative e percorsi culturali in Vita e avventure di Dositej Obradović. Liguori Ed., Napoli 2011.
No full textproposta di analisi del lessico dositejano sullo sfondo del dibattito europeo in materia etico-religiosa nel XVIII secoloThe author attracts attention on the necessity of examining Dositej's vocabulary with regards to its connection with European ethic and religious controversies during XVIIIth centur
THE PARTITION DIMENSION OF GRAPHS
Get PDFDiplomsko delo obravnava particijsko dimenzijo grafov in je sestavljeno iz treh poglavij.
V prvem poglavju bomo predstavili osnovne pojme iz teorije grafov in spoznali bomo štiri najbolj poznane produkte grafov, s poudarkom na kartezičnem produktu.
Drugo poglavje bomo namenili predstavitvi dveh, za nas najbolj pomembnih dimenzij grafov. To sta metrična in particijska dimenzija grafov. Najprej bomo definirali metrično dimenzijo grafov in spoznali njene lastnosti. Nato se bomo posvetili particijski dimenziji grafov in njenim lastnostim. Pri obeh dimenzijah bomo za boljšo predstavitev podali tudi nekaj primerov. Na koncu tega poglavja pa si bomo še pogledali povezanost omenjenih dveh dimenzij.
V zadnjem poglavju bomo definirali particijsko dimenzijo kartezičnega produkta grafov. Pogledali si bomo zgornjo mejo te dimenzije, nato bomo spoznali njeno povezavo z metrično dimenzijo in na koncu navedli še dva aktualna odprta problema.The diploma paper discusses the partition dimension of graphs and consists of three chapters.
In the first chapter the basic terms of the graph theory as well as the four most widely known products of graphs, with the emphasis on the Cartesian product, are presented.
The second chapter is devoted to the presentation of the two for us most important dimensions of graphs. These are the metric and the partition dimension of graphs. First of all the metric dimension of graphs and it characteristics are presented. Afterwards the emphasis is on the partition dimension of graphs and its features. For a better understanding of both dimensions some examples are added. At the end of this chapter the connections between the two dimensions are presented.
In the last chapter the partition dimension of the Cartesian product of graphs is defined. The upper bound of this dimension and the connections with the metric dimension are also shown. In the end two current open problems are stated
MATHEMATICAL MODEL OF UNO
Get PDFDiplomsko delo, ki je razdeljeno na tri poglavja, predstavlja matematični model igre Enka. V prvem poglavju bomo najprej definirali in opredelili osnovne pojme, ki jih bomo potrebovali v nadaljevanju. V drugem poglavju bomo predstavili dva matematična modela Enke in njuni obliki ter definirali graf Enke. Sledila bo karakterizacija ENKA-1 grafov, nato bo predstavljen še graf šahovnice, ki je definiran podobno kot ENKA-1 graf. V zadnjem poglavju bomo predstavili zahtevnosti Enke z dvema igralcema in Enke z enim igralcem. Pokazali bomo, da sta pripadajoča problema ENKA-2 in ENKA-1 -polna problema.The purpose of this graduation thesis is to present mathematical model of the card game Uno and is divided into three sections. First section of the thesis defines basic concepts, which will be used throughout this study. Second section presents two mathematical models, their forms and define graph of Uno, followed by characterization of graph UNO-1. In addition, second section includes chessboard, which is defined similarly as graph UNO-1. Last section presents complexity of Uno with two players and Uno with one player. Moreover, the third section of this graduation thesis demonstrates that associated problems of UNO-2 and UNO-1 are - complete
Decomposition of cartesian products of regular graphs into isomorphic trees
Get PDFDiplomsko delo obravnava družine 2m-regularnih grafov in m-regularnih dvodelnih grafov, ki se dekomponirajo v izomorfne kopije drevesa T z m povezavami. Obravnavana je k-terica r1,..., rk z vsoto i=1 do k ri = m. Za drevo T s takim k-barvanjem po povezavah z r i povezavami barve i, da ima vsaka pot v T eno ali dve povezavi iste barve, je predstavljen rezultat, da se vsak kartezični produkt grafov G1,...,Gk, kjerje Gi 2ri-regularen graf za 1 <= i <= k, dekomponira v kopije drevesa T.The diploma paper discesses the families of 2m-regular graphs and m-regular bipartite graphs that are known to decompose into isomorphic copies of a tree T with m edges. A k-tuple r1,...,rk with i=1 k ri=m. Is considered k-edge-coloring with ri edges of color i, such that every path in T use some color once or twice. For a tree containing the result that every cartesian product of graphs G1,..., Gk, such that Gi is 2ri-regular for 1 <= i <= k, decomposes into copies of T is presented
Darinka Karadžova, Sliven i Elena prez Văzraždaneto. Prinos kăm izsledvanijata. Sofija, Bolid-Ins 2014, pp. 519
No full textAnalisi codicologica di alcuni manoscritti attinenti alla storia culturale delle terre bulgare orientali tra fine XVIII e inizi XIX secolo.L'autopsia dei manoscritti permette all'a. di fare alcune importanti precisazioni circa il ruolo avuto dai protagonisti nelle vicende restituite. Lì dove i testimoni non sono sufficienti, le notizie sono ricostruite con il supporto dei materiali folclorici.Analysis of some manuscripts relating to the cultural history of Bulgarian eastern lands between the end of 18°th and the beginning of 19°th century. Thanks to the autopsy of the codes, the author may fix the roles of the protagonists of the stories which she reconstructs. Where the news are not sufficient, the information is integrated with material coming from popular poetry
Una clinica umanamente dura
No full textI risultati ottenuti da una nota analista infantile nella remissione di severi disturbi del linguaggio nei bambini ci offrono informazioni inedite e essenziali sui meccanismi del linguaggio nell'uomoThe author illustrates how the cross of psychoanalytic approach with the results of neurosciences can reveal new capital information about language mechanismes in me
- …
