Jezik: | Slovenski jezik |
---|---|
Leto izida: | 2011 |
Izvor: | Maribor |
Tipologija: | 2.11 - Diplomsko delo |
Organizacija: | UM FNM - Fakulteta za naravoslovje in matematiko |
Založnik: | [J. Pišek] |
UDK: | 51(043.2) |
COBISS: | 18720008 |
Št. ogledov: | 2128 |
Št. prenosov: | 100 |
Ocena: | 0 (0 glasov) |
Metapodatki: |
Sekundarni jezik: | Angleški jezik |
---|---|
Sekundarni naslov: | Rainbow connection in graphs |
Sekundarni povzetek: | 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. |
Sekundarne ključne besede: | 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: |
Vrsta dela (COBISS): | Diplomsko delo |
Komentar na gradivo: | Univ. v Mariboru, Fak. za naravoslovje in matematiko, Oddelek za matematiko in računalništvo |
Strani: | 30 f. |
Ključne besede (UDK): | mathematics;natural sciences;naravoslovne vede;matematika;mathematics;matematika; |
ID: | 19553 |