diplomsko delo
Renato Smej (Author), Marko Jakovac (Mentor)

Abstract

V diplomskem delu je obravnavano povezano dominantno število grafa. Na začetku so podrobneje razloženi osnovni pojmi teorije grafov, ki so potrebni za razumevanje celotnega dela. V osrednjem delu so opisane lastnosti povezanega dominantnega števila grafa ter predstavljene družine grafov, za katere je dominantno število in povezano dominantno število grafa enako. Na koncu so opisani še povezano dominantno kritični grafi in naštetih nekaj njihovih lastnosti.

Keywords

diplomska dela;teorija grafov;dominantno število;povezano dominantno število;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FNM - Faculty of Natural Sciences and Mathematics
Publisher: [R. Smej]
UDC: 519.17(043.2)
COBISS: 20237064 Link will open in a new window
Views: 1156
Downloads: 118
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: Connected domination number of graph
Secondary abstract: The thesis deals with the connected domination number of a graph. At the beginning, the basic contepts of graph theory are explained in detail, because they are necessary to understand the entire work. The central part describes the properties and observations of the connected domination number of a graph and also presents special graphs, for which the domination number of the graph and the connected domination number of the graph are the same. At the end, the connected domination critical graphs and some of their properties are presented.
Secondary keywords: domination number;connected domination number.;
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: 53 f.
ID: 8728235