PELABELAN LINGKARAN-AJAIB SUPER PADA GRAF BIPARTIT LENGKAP
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/74478 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | 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 H1 = (V 1, E1) of G isomorphic to Cp
satis?es that f (H1) = ) f (v)+ ) f (e) is constant. When f (V ) = {1, 2,..., |V |},
v?V I
e?EI
then G is said Cp-supermagic. We prove that the complete bipartite graph Km,n is
Cp-supermagic for some m, n and p.
|
|---|