Geodetsko in ovojniško število produktov grafov

diplomsko delo

Jasna Mrkonjić (Author), Boštjan Brešar (Mentor)

Abstract

Diplomsko delo obravnava geodetsko in ovojniško število standardnih produktov grafov s poudarkom na kartezičnem in krepkem produktu. V prvem delu so zapisane osnovne definicije s področja teorije grafov, ki se uporabljajo v nadaljevanju. V naslednjem poglavju si ogledamo grafe, za katere je geodetsko število enako ali za ena manjše od števila vozlišč ter enako za ovojniško število. Sledi poglavje, v katerem se osredotočimo na geodetsko in ovojniško število v kartezičnem produktu grafov in si ogledamo robne množice. Zadnji del diplomskega dela je namenjen geodetskemu in ovojniškemu številu v krepkem produktu grafov, kjer so podane meje za obe števili in natančne vrednosti za določene tipe grafov.

Keywords

matematika;grafi;produkti;množice grafov;konveksnost;ovojnice;geodetsko število;ovojniško število;polni grafi;cikel;kartezični produkt;krepki produkt;robne množice;diplomska dela;

Data

Language:	Slovenian
Year of publishing:	2010
Source:	Maribor
Typology:	2.11 - Undergraduate Thesis
Organization:	UM FNM - Faculty of Natural Sciences and Mathematics
Publisher:	[J. Mrkonjić]
UDC:	51(043.2)
COBISS:	18022920
Views:	2328
Downloads:	119
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	The geodetic and the hull number of graph products
Secondary abstract:	The geodetic and hull number in standard products of graphs is studied in this diploma thesis with special emphasis on the Cartesian and Strong product of graphs. The fifirst chapter contains basic defifinitions from the area of graph theory that are needed later. In the next chapter we take a look at graphs for which the geodetic number is equal or one less than the order of a graph and similar for the hull number. In Chapter 3 the focus is on the geodetic and hull number in the Cartesian product graphs and on their boundary sets. The last part of diploma is devoted to geodetic and hull number in Strong product of graphs, where the bounds and exact values for different types of graphs are given.
Secondary keywords:	convexity;hull;geodetic set of a graph;geodetic number;hull number;complete graph;cycle;product graphs;cartesian product;strong product;boundary sets;
URN:	URN:SI:UM:
Type (COBISS):	Undergraduate thesis
Thesis comment:	Univ. v Mariboru, Fak. za naravoslovje in matematiko, Oddelek za matematiko in računalništvo
Pages:	41 f.
Keywords (UDC):	mathematics;natural sciences;naravoslovne vede;matematika;mathematics;matematika;
ID:	18947