#TITLE_ALTERNATIVE#
In this book, we study the notion of critical sets in graph labeling. Firstly, critical sets introduced by Nelder (1977), Curan, and van Rees (1978) for latin square. Then, ETB (2005) apply that concept to graph labeling. We search the numbers of critical sets from an edge magic total labeling on do...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/9847 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |
| 總結: | In this book, we study the notion of critical sets in graph labeling. Firstly, critical sets introduced by Nelder (1977), Curan, and van Rees (1978) for latin square. Then, ETB (2005) apply that concept to graph labeling. We search the numbers of critical sets from an edge magic total labeling on double star. We construct an algorithm, and presented it with some computational result. Some pictures are given to facilitate understanding. As a result, we reveal the numbers of critical sets and its pattern on double star with edge magic total labeling Kotzig Rosa and edge magic total labeling Even Odd. <br />
|
|---|