| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Povezana particijska dimenzija grafov
Authors:ID Slemenšek, Jasna (Author)
ID Jerebic, Janja (Mentor) More about this mentor... New window
Files:.pdf UN_Slemensek_Jasna_2016.pdf (715,85 KB)
MD5: AA20B23EB1C643B31003C665B520ECC4
 
Language:Slovenian
Work type:Undergraduate thesis
Typology:2.11 - Undergraduate Thesis
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Diplomsko 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.
Keywords:Rešljiva particija, particijska dimenzija grafov, povezana particijska dimenzija grafov, drevesa, kolesa, Jahangrovi grafi.
Place of publishing:Maribor
Publisher:[J. Slemenšek]
Year of publishing:2016
PID:20.500.12556/DKUM-61546 New window
UDC:519.17(043.2)
COBISS.SI-ID:22572808 New window
NUK URN:URN:SI:UM:DK:W7TTE7HG
Publication date in DKUM:23.09.2016
Views:1255
Downloads:88
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:Connected partition dimension of graphs
Abstract: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.
Keywords:Resolving partition, partition dimension of graphs, connected partition dimension of graphs, trees, wheels, Jahangir 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