Language: | Slovenian |
---|---|
Year of publishing: | 2011 |
Source: | Maribor |
Typology: | 2.11 - Undergraduate Thesis |
Organization: | UM FNM - Faculty of Natural Sciences and Mathematics |
Publisher: | [J. Pišek] |
UDC: | 51(043.2) |
COBISS: | 18720008 |
Views: | 2128 |
Downloads: | 100 |
Average score: | 0 (0 votes) |
Metadata: |
Secondary language: | English |
---|---|
Secondary title: | Rainbow connection in graphs |
Secondary abstract: | This thesis focuses on the rainbow connection number and strong rainbow connection number in the graph. We start by presenting the basic concepts of graph theory needed to understand the thesis. The task included the rainbow connection number and strong rainbow connection number of some well known graphs. The rainbow connection number with the prescribed values are also included. At the end we study rainbow connection number and strong rainbow connection number on strong and lexicographic product. |
Secondary keywords: | graph;complete graph;complete bipartite graph;cycle;wheels;path;tree;edge coloring;(strong) rainbow coloring;(strong) rainbow connection number;strong product;lexicographic product; |
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: | 30 f. |
Keywords (UDC): | mathematics;natural sciences;naravoslovne vede;matematika;mathematics;matematika; |
ID: | 19553 |