Browsing Fakultas Matematika dan Ilmu Pengetahuan Alam by Subject "Super (a, d)-S_3, Decomposition, Helm Graph, and ciphertext"
Now showing items 1-1 of 1
-
Antimagic Total Dekomposisi Graf Helm dan untuk Pengembangan Ciphertext
(2016-02-02)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 ...