KEKRITISAN GRAF PADA BILANGAN KROMATIK

Kurniawan, Eko (2010) KEKRITISAN GRAF PADA BILANGAN KROMATIK. Other thesis, University of Muhammadiyah Malang.

[img]
Preview
Text
KEKRITISAN_GRAF_PADA_BILANGAN_KROMATIK.pdf

Download (88kB) | Preview

Abstract

A colouring of graph is giving colour method at the element of graph consist of vertex colouring, edge, and region. Vertex colouring can be defined as giving colour at each vertex in graph, so at two vertexs that are nearer have the different colours. This research is aimed to know the characteristics of chromatic number and the critical of a graph G. Chromatic number of G graph is a minimum number of colour that needed in colouring vertex at G graph, it is denoted χ(G). If χ(G)=n, so the vertex at G graph can be coloured with in colour, but the vertex at G cannot be coloured with n-1 colour. After the chromatic number of χ(G) from a G graph have known, the critical of G graph can be predicted. A G graph can be defined as critical if χ(G-v)<χ(G) for each V at G.

Item Type: Thesis (Other)
Subjects: L Education > L Education (General)
Divisions: Faculty of Teacher Training and Education > Department of Mathematics and Computing
Depositing User: Rayi Tegar Pamungkas
Date Deposited: 08 May 2012 02:09
Last Modified: 08 May 2012 02:09
URI: http://eprints.umm.ac.id/id/eprint/4581

Actions (login required)

View Item View Item