Antimagic Total Dekomposisi Graf Helm dan untuk Pengembangan Ciphertext
A graph $G(V,E)$ has a $H$-Covering if every edge in $E$ belongs to a subgraph of $G$ isomorphic to $H$. The $(a,d)-H$ antimagic covering on the G graph is a biijective functin of $f:V(G)\cup E(G) \rightarrow \{1,2,...,|V(G)|+|E(G)|\}$ till all of the $H'$ subgraphs that isomorphic to H have we...
Saved in:
Main Author: | K. Rosyidah, Dafik, S. Setiawani (Author) |
---|---|
Format: | Academic Paper |
Published: |
2016-02-02T06:50:44Z.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
SUPER (a; d)-H ANTIMAGIC TOTAL DEKOMPOSISI PADA AMALGAMASI GRAF KIPAS
by: Nafisah, Khuri Faridatun
Published: (2015) -
SUPER (a; d) ¡ AP O ANTI AJAIB TOTAL DEKOMPOSISI GRAF SHACKLE GENERALISASI ANTIPRISMA UNTUK PENGEMBANGAN CIPHERTEXT DAN KETERAMPILAN BERPIKIR TINGKAT TINGGI
by: Azizah, Yuli Nur
Published: (2016) -
Super (a,d)-{H}-Antimagic Total Selimut pada Amalgamasi Graf Roda untuk Pengembangan Kriptosistem Polyalphabetic
by: Novri Anggraeni., Dafik., Slamin
Published: (2016) -
Super Edge Antimagic Total pada Generalisasi Shackle Graf Kipas dan Aplikasinya dalam Pengembangan Cryptosystem
by: Muhlisatul Mahmudah, Dafik, Slamin
Published: (2016) -
Pelabelan Total Super (a,d) - Sisi Antimagic Pada Graf Crown String
by: Enin Lutfi Sundari, et al.
Published: (2015)