ADIATI, ESTU
(2014)
*APLIKASI PEWARNAAN PETA DI MALANG RAYA.*
Other thesis, University of Muhammadiyah Malang.

## Abstract

Graph coloring is giving colors to the vertices of a graph in which two adjacent vertices may not have the same color. There are several types of graph coloring include vertex coloring, edge coloring and face coloring. This thesis discusses of one type of graph coloring that is an vertex coloring and applied to the map in Malang Raya. Suppose a graph G with vertex set V(G) and the edge set E(G). The number of vertex in G is p and the number of edge in G is q. To form a graph on the map Malang Raya, districts considered as vertex and sub districts that adjacent connected by edge considered edge. Vertex coloring a graph G is giving colors to the vertex which two adjacent vertex have different colors. . The steps for coloring maps in Malang Raya is label the vertex v_(1 ,) v_(2 ,)Â…,v_n according sort of the largest degree in a graph, giving color based the greatest degree of sequence in accordance with the principle of Welsh and Powell algorithm. Results of this study declare that the use of Welsh and Powell algorithm in Malang Raya map can be colored using only four different colors.

Item Type: | Thesis (Other) |
---|---|

Subjects: | Q Science > QA Mathematics |

Divisions: | Faculty of Teacher Training and Education > Department of Mathematics Education (84202) |

Depositing User: | Gusti Vani Putri Cahya |

Date Deposited: | 11 Feb 2015 13:20 |

Last Modified: | 11 Feb 2015 13:20 |

URI : | http://eprints.umm.ac.id/id/eprint/16048 |

### Actions (login required)

View Item |