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 |
| id |
id-itb.:74478 |
|---|---|
| spelling |
id-itb.:744782023-07-17T08:47:50ZPELABELAN LINGKARAN-AJAIB SUPER PADA GRAF BIPARTIT LENGKAP Deni Purnama, Agus Indonesia Final Project Complete bipartite, cycle, Cp-magic labeling, Cp-supermagic labeling, graph labeling. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/74478 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. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
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.
|
| format |
Final Project |
| author |
Deni Purnama, Agus |
| spellingShingle |
Deni Purnama, Agus PELABELAN LINGKARAN-AJAIB SUPER PADA GRAF BIPARTIT LENGKAP |
| author_facet |
Deni Purnama, Agus |
| author_sort |
Deni Purnama, Agus |
| title |
PELABELAN LINGKARAN-AJAIB SUPER PADA GRAF BIPARTIT LENGKAP |
| title_short |
PELABELAN LINGKARAN-AJAIB SUPER PADA GRAF BIPARTIT LENGKAP |
| title_full |
PELABELAN LINGKARAN-AJAIB SUPER PADA GRAF BIPARTIT LENGKAP |
| title_fullStr |
PELABELAN LINGKARAN-AJAIB SUPER PADA GRAF BIPARTIT LENGKAP |
| title_full_unstemmed |
PELABELAN LINGKARAN-AJAIB SUPER PADA GRAF BIPARTIT LENGKAP |
| title_sort |
pelabelan lingkaran-ajaib super pada graf bipartit lengkap |
| url |
https://digilib.itb.ac.id/gdl/view/74478 |
| _version_ |
1822993813605449728 |