SOME SUPER EDGE-MAGIC TOTAL LABELINGS OF THE TREE GRAPH T A,C,D

• المؤلف الرئيسي: SURYADI, IYAN
• التنسيق: Theses
• اللغة: Indonesia
• الوصول للمادة أونلاين: https://digilib.itb.ac.id/gdl/view/10711
• المؤسسة: Institut Teknologi Bandung

Let G = (V (G), E (G) ) be a simple and finite graph with the vertex-set V (G) and the edge-set E (G). An edge-magic total labeling of a graph G is an injective function f from V (G) U E (G) ke {1,2,3, … , |V (G) | + |E (G) |} such that there exists a positive integer...