Fakultas Matematika dan Ilmu Pengetahuan Alam
Browse by
Recent Submissions
-
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 ... -
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 Super (a,d)- {H} Antimagic Total Dekomposisi pada Shakel dari Graf Kipas Konektif
(2016-02-18)All graph in this paper are finite, simple and undirected. By $H'$-covering, we mean every edge in $E(G)$ belongs to at least one subgraph of $G$ isomorphic to a given graph $H$. A graph $G$ is said to be an $(a, ... -
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 Covering of Chain Graph
(2016-02-18)All graph in this paper are finite, simple and undirected. By $H'$-covering, we mean every edge in $E(G)$ belongs to at least one subgraph of $G$ isomorphic to a given graph $H$. A graph $G$ is said to be an $(a, ... -
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 ... -
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 ... -
On r-Dynamic Coloring of Some 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 ...
RSS 1.0