Browsing Arsip SKKD by Subject "{H}-super antimagic total covering, wheel graph, and cryptosystem"
Now showing items 1-1 of 1
-
Super (a,d)-{H}-Antimagic Total Selimut pada Amalgamasi Graf Roda untuk Pengembangan Kriptosistem Polyalphabetic
(2016-02-18)A graph $G(V,E)$ has a $\mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isomorphic to $\mathcal{H}$. An $(a,d)$-$\mathcal{H}$-antimagic total covering is a total labeling $\lambda$ from $V(G)\cup ...