PELABELAN KN-AJAIB SUPER DAN (A;D)-KN-ANTIAJAIB SUPER PADA GRAF LENGKAP KN KORONA GRAF LENGKAP KN,1
Let G = (V (G);E(G)) be a graph and H be a subgraph of G. Graph G admits H-covering, if every edge in G belongs to subgraph of G isomorphic to H. An H-magic labelling of G which admits H-covering is a bijection f : V (G) [ E(G) ! f1; 2; :::; jV (G)j+jE(G)jg such that there is a magic constant C s...
Saved in:
Main Author: | NANDA MARDANI, ZAGALO |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/19759 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
PELABELAN LINGKARAN-AJAIB SUPER PADA GRAF BIPARTIT LENGKAP
by: Deni Purnama, Agus -
PELABELAN Cn - AJAIB SUPER PADA GRAF KHUSUS
by: HARI NUGRAHA, 080513295
Published: (2011) -
Pelabelan Total (a,d)-H-Antiajaib (Super) pada Graf
by: Liliek Susilowati, S.Si, M.Si.
Published: (2013) -
Pelabelan Total (a,d)-H-Antiajaib (Super) pada Graf
by: Liliek Susilowati, S.Si., M.Si, et al.
Published: (2013) -
Pelabelan total (a,d)-H-Antiajaib (Super) pada Graf
by: Liliek Susilowati, 2012
Published: (2012)