diplomsko delo
Tjaša Grahornik (Author), Marko Jakovac (Mentor)

Abstract

V diplomskem delu je predstavljeno dinamično barvanje grafov. V uvodnih poglavjih so predstavljeni osnovni pojmi iz teorije grafov, ki so pomembni za razumevanje diplomskega dela. Ogledali si bomo, kakšno je dinamično kromatično število za polne grafe, drevesa in cikle. V diplomskem delu so opisane znane zgornje meje za dinamično kromatično število. Primerjali smo kromatično število in dinamično kromatično število za normalne grafe in regularne grafe. Ugotovili smo, da je razlika med dinamičnim kromatičnim številom in kromatičnim številom poljubno velika za nekatere grafe. Del diplomskega dela bomo posvetili tudi dinamičnemu barvanju kartezičnega produkta dveh grafov in zaključili s posplošitvijo dinamičnega barvanja.

Keywords

diplomska dela;matematika;barvanje grafov;

Data

Language: Slovenian
Year of publishing:
Source: Maribor
Typology: 2.11 - Undergraduate Thesis
Organization: UM FNM - Faculty of Natural Sciences and Mathematics
Publisher: [T. Grahornik]
UDC: 51(043.2)
COBISS: 19411976 Link will open in a new window
Views: 1390
Downloads: 130
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: DYNAMIC COLORING OF GRAPHS
Secondary abstract: The graduation thesis presents the dynamic coloring of graphs. In the first chapter we present basic concepts of graph theory, which are important for understanding the thesis. We will determine the dynamic chromatic number for complete graphs, trees and cycles. The thesis describes the known upper bounds for the dynamic chromatic number. We compared the chromatic number and the dynamic chromatic number for normal and regular graphs. We found out that the difference between the dynamic chromatic number and the chromatic number is arbitrarily large for some graphs. Part of the thesis will be about dynamic chromatic number of the Cartesian product of two graphs and we will conclude with a generalization of dynamic coloring of graphs.
Secondary keywords: dynamic coloring of graphs;upper bounds;The Cartesian product;a generalization of dynamic coloring;
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: VIII, 42 f.
Keywords (UDC): mathematics;natural sciences;naravoslovne vede;matematika;mathematics;matematika;
ID: 1000202
Recommended works:
, diplomsko delo
, Seminar on algebraic combinatorics, Ben-Gurion University of the Negev, Beer Sheva, Israel, April 10, 2002
, Group Theory Seminar, 21.5.2008, Ohio State University, Columbus, Ohio, USA
, Seminar on algebraic combinatorics, Ben-Gurion University of the Negev, Beer Sheva, Israel, June 25, 2008
, Visiting Assistant Professor, 1.10.-31.12.2008, Ohio State University, Columbus, Ohio, USA