Please use this identifier to cite or link to this item:
http://repository.ipb.ac.id/handle/123456789/158458
Title: | Sifat-sifat Set Chromatic Number pada Sebuah Graf |
Other Titles: | |
Authors: | Mas'oed, Teduh Wulandari Septyanto, Fendy Garini, Nilam Nindya |
Issue Date: | 2024 |
Publisher: | IPB University |
Abstract: | Proper coloring adalah pemberian warna pada verteks-verteks di sebuah graf dengan syarat setiap verteks yang adjacent memiliki warna yang berbeda. Banyak warna minimum yang dapat memenuhi proper coloring di graf ?? disebut chromatic number. Neighborhood color set adalah himpunan warna yang diberikan kepada verteks-verteks di neighborhood suatu verteks. Set coloring adalah pemberian warna pada verteks-verteks di sebuah graf dengan syarat setiap verteks
yang adjacent memiliki neighborhood color set yang berbeda. Banyak warna
minimum yang dapat memenuhi set coloring di graf ?? disebut set chromatic
number. Kemiripan syarat kedua pewarnaan tersebut menimbulkan kemiripan juga
terhadap chromatic number dan set chromatic number. Tujuan penelitian ini adalah
membuktikan teorema-teorema yang berlaku pada set chromatic number. Pada
penilitian ini, teorema yang berlaku pada set chromatic number terbukti dengan
dukungan teorema yang berlaku pada chromatic number Proper coloring is assigning color to vertices in a graph with the condition that each adjacent vertex has a different color. The minimum number of colors that can fulfill proper coloring in graph G is called the chromatic number. Neighborhood color set is a set of colors given to vertices in theneighborhood of a vertex. Set coloring is assigning colors to vertices in a graph with the condition that each adjacent vertex has a different neighborhood color set. The minimum number of colors that can satisfy the set coloring in graph G is called the set chromatic number. The similarity of the requirements for the two colorings also gives rise to similarities in the chromatic number and set chromatic number. The aim of this research is to prove theorems that apply to sets of chromatic number. In this research, theorems that apply to sets of chromatic number are proven with the support of theorems that apply to chromatic number. |
URI: | http://repository.ipb.ac.id/handle/123456789/158458 |
Appears in Collections: | UT - Mathematics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
cover_G5401201071_ba51490441a34f47aa809537780137da.pdf | Cover | 695.48 kB | Adobe PDF | View/Open |
fulltext_G5401201071_d62606d7143d4de4a4bded0ee727f139.pdf Restricted Access | Fulltext | 5.27 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.