(Ck,Ck+1)- SUPERMAGIC LABELINGS OF CUPOLA GRAPH Cu(k,k+1,n)
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...
Saved in:
Main Author: | Muhammad Issaac, Gardhani |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/44343 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
Case study on C.K. Tang Ltd.
by: Chia, Sok Luan., et al.
Published: (2008) -
(H1, H2)-SIM-SUPERMAGIC LABELINGS AND (H1| H2)-SUPERMAGIC LABELINGS OF SOME GRAPHS AND CERTAIN GRAPHS FORMED BY GRAPH OPERATIONS
by: Fadhilah Ashari, Yeva -
Extended Star Supermagic Labelings on Theta Graphs
by: LAWA (NIM: 20106017), DAUD -
A CHARACTERIZATION OF (Cn;K1;n)-SUPERMAGIC OF TREES CORONA PATHS AND TREES JOIN A TRIVIAL GRAPH
by: Fadhilah Ashari, Yeva -
WHEEL-SUPERMAGIC LABELINGS FOR A WHEEL CORONA MULTILEVEL-k WITH A CYCLE
by: HOGLA TATI MARBUN ( NIM :10108102); Pembimbing : Prof Dr. M. Salman A. N,