Now showing items 1-9 of 9

• #### Antimagic Total Dekomposisi Graf Helm dan untuk Pengembangan Ciphertext ﻿

(2016-02-02)
• #### Pelabelan Super ({\it a,d})-${\mathcal {H}}$-Antimagic Total Dekomposisi pada Graf Windmill ﻿

(2016-02-18)
Diberikan suatu graf G sedehana, dan tidak berarah. $f(V)=\{1,2,3,...,p\}$ dan $f(E)=\{p+1,...,p+q\}$ dikatakan sebagai pelabelan super. Pelabelan super ({\it a,d})-${\mathcal {H}}$-antimagic total selimut merupakan ...
• #### Pelabelan Total Super ($a,d$) - Face Antimagic dari Graf Shackle ($C_5,e,n$) ﻿

(2016-02-18)
Let $G$ be a simple graph of order $p$, size $q$ and face $r$. The graph $G$ is called a super ($a,d$) - face antimagic total labeling , if there exist a bijection $f:V(G)\cup E(G)\cup F(G)$ $\rightarrow \{1,2,...,p+q+r\}$ ...
• #### The r-Dynamic Chromatic Number of Special Graph Operations ﻿

(2016-02-02)
Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural number. By a proper $k$-coloring of a graph $G$, we mean a map $c : V (G) \rightarrow S$, where $|S| = k$, such that any two adjacent vertices ...
• #### Super $(a,d)$ - Face Antimagic Total Labeling of Shackle of Cycle Graph ﻿

(2016-02-18)
A graph $G$ of order $p$, size $q$ and face $r$ is called a super $(a,d)$ - face antimagic total labelling, if there exist a bijection $f:V(G)\bigcup E(G)\bigcup F(G)$ $\rightarrow \{1,2,...,p+q+r\}$ such that the set ...
• #### 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 ...