ESTD PERPUSTAKAAN UNTAD
ESTD PERPUSTAKAAN UNTAD
| JudulPELABELAN TOTAL SISI AJAIB SUPER PADA SELURUH GRAF POHON DENGAN 18 TITIK |
| Nama: ANGREANI NASTYA TRIPUTRI |
| Tahun: 2020 |
| Abstrak An total edge magic labeling of a graph G with p vertices and q edges is one to one correspondence f from V(G)?E(G) to {1,2,…,p+q} such that for all edges uv, f(u)+f(v)+f(uv) is constant. A graph G is called edge magic if there exists an edge magic labeling of G. An super edge magic labeling of a graph G with p vertices and q edges is an edge magic labeling f of G with the property that f(V(G))={1,2,…,p}. A graph G is called super edge magic if there exists a super edge magic labelling of G. Enomoto et al. conjectured that all trees are super edge magic. This conjecture has become popular in graph labeling, so that some researcher has been proven for some several classes of tree graphs. Super edge magic has been proven until 17 vertices by Lee and Shah. In this study, continues the proof from conjecture that said all trees are super edge magic on tree graphs with 18 vertices. Keywords : Tree Graphs With 18 Vertices, Super Edge Magic Labeling. |