BILANGAN KROMATIK LOKASI GRAF POHON DAN KARAKTERISASI GRAF DENGAN BILANGAN KROMATIK LOKASI 3
The locating-chromatic number of a graph was introduced by Chartrand et al. in 2002. This concept is derived from the graph partition dimension and graph coloring. The partition dimension of a graph was firstly studied by Chartrand, Zhang, and Salehi in 1998. They gave the partition dimension for so...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Dissertations |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/15061 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | The locating-chromatic number of a graph was introduced by Chartrand et al. in 2002. This concept is derived from the graph partition dimension and graph coloring. The partition dimension of a graph was firstly studied by Chartrand, Zhang, and Salehi in 1998. They gave the partition dimension for some classes of trees, such as paths, double stars, and caterpillars. Since then, many studies have been conducted to find the partition dimension for the other certain classes of graphs. In this dissertation, we determine the locating-chromatic number of some classes of trees, namely an amalgamation of stars, banana trees, firecrackers, and caterpillars |
|---|