WHEEL-SUPERMAGIC LABELINGS FOR A WHEEL CORONA MULTILEVEL-k WITH A CYCLE
Graph G corona graph H, denoted by G H, is the graph that obtained from one copy of G and |V(G) | copies of H, namely H1, H2, ..., H|V(G)| , and joining the and joining the point-i vertex of G with an edge to every vertex in the G dan |V(G) | copy of H. Let k be a positive integer. A graph G1 coron...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/15953 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|