PELABELAN LINGKARAN-AJAIB SUPER PADA GRAF BIPARTIT LENGKAP

• Main Author: Deni Purnama, Agus
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/74478
• Institution: Institut Teknologi Bandung

Let Cp be a cycle on p vertices. A simple graph G = (V, E) admits a Cp-covering if every edge in E belongs at least to one subgraph of G isomorphic to a given cycle Cp. The graph G is called Cp-magic if there exists a total labeling f : V ? E ? {1, 2,..., |V |+|E|} such that for every subgraph...