| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:PALIČNO ŠTEVILO GRAFA
Authors:ID Mikelj, Barbara (Author)
ID Jerebic, Janja (Mentor) More about this mentor... New window
Files:.pdf UNI_Mikelj_Barbara_2011.pdf (457,36 KB)
MD5: 3EF6922AA4EB569EACFCB765B041488D
PID: 20.500.12556/dkum/16bfa6d1-9a65-4008-a3ed-ac5a6309db82
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Diplomsko 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 $G \square K_n$, 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.
Keywords:teorija grafov, igre na grafih, igra s palicami, palično število grafa
Place of publishing:Maribor
Publisher:[B. Mikelj]
Year of publishing:2011
PID:20.500.12556/DKUM-21063 New window
UDC:51(043.2)
COBISS.SI-ID:18751752 New window
NUK URN:URN:SI:UM:DK:3YFHUO2X
Publication date in DKUM:09.11.2011
Views:2519
Downloads:103
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.

Secondary language

Language:English
Title:GRAPH PEGGING NUMBER
Abstract: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 $G \square K_n$, 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.
Keywords:graph theory, games on graphs, graph pegging, pegging number


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