(Ck,Ck+1)- SUPERMAGIC LABELINGS OF CUPOLA GRAPH Cu(k,k+1,n)

• 主要作者: Muhammad Issaac, Gardhani
• 格式: Final Project
• 語言: Indonesia
• 在線閱讀: https://digilib.itb.ac.id/gdl/view/44343
• 機構: Institut Teknologi Bandung

Let G=(V,E) be a simple graph. Let H_1 and H_2 are two subgraphs of G. G=(V,E) admits (H_1,H_2)-covering if every edge in E belongs to a subgraph of G that isomorphic to H_1 or H_2. $G$ is called (H_1,H_2-Magic if there are two fixed positive integers k_1 and k_2 and a bijective function f: V? E? {1...