Search
Now showing items 1-8 of 8
Super (a,d)H-Antimagic Total Selimut pada Graf Triangular Cycle Ladder untuk Pengembangan Ciphertext
(2016-01-28)
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 ...
Super Edge Antimagic Total pada Generalisasi Shackle Graf Kipas dan Aplikasinya dalam Pengembangan Cryptosystem
(2016-01-28)
A graph $G$ of order $p$ and size $q$ is called an {\it
$(a,d)$-edge-antimagic total}
if there exist a bijection $f : V(G)\cup E(G)
\to \{1,2,\dots,p+q\}$ such that the edge-weights,
$w(uv)=f(u)+f(v)+f(uv), uv \in ...
Super (a,d)-H- Antimagic Total Coveringf on Shackle of Cycle with Cords
(2016-01-28)
Graph $G$ is a simple, finite and undirected graph. A graph
$G$ is called to be an $(a,d)-H$-antimagic total covering if there
is a bijective fuction $\lambda: V(G) \cup E(G) \rightarrow \{1,
2,\dots ,|V (G)| + |E(G)|\}$, ...
Super (a,d)-H-Antimagic Total Covering of Connected Semi Jahangir Graph
(2016-02-18)
Let $G$ be a finite, simple and undirected graph. A graph $G$ is
called to be an $(a, d)$-$H$-antimagic total covering if there exist a
bijective function $f: V(G) \cup E(G) \rightarrow \{1, 2,\dots ,|V
(G)| + |E(G)|\}$ ...
Super (a,d)-edge Antimagic Total Labeling of\\ Shackle ($F_6, B_2, n$) for Developing a Polyalphabetic Cryptosystem
(2016-02-18)
A graph $G$ of order $p$ and size $q$ is called an $(a,d)$-edge-antimagic total
if there exist a bijection $f : V(G)\cup E(G)
\to \{1,2,\dots,p+q\}$ such that the edge-weights,
$w(uv)=f(u)+f(v)+f(uv), uv \in E(G)$, ...
Pelabelan Total Super $(a,d)$-Sisi Antimagic pada Graf Shackle Fan Berorder 5
(2016-02-18)
et $G$ be a simple graph
of order $p$ and size $q$. The graph $G$ is called an {\it
$(a,d)$-edge-antimagic total graph} if there exist a bijection $f :
V(G)\cup E(G) \to \{1,2,\dots,p+q\}$ such that the edge-weights,
...
On $r$-Dynamic Coloring for Operation Product of Cycle and Cycle Graphs
(2016-02-18)
For integer $k,r>0,(k,r)$ -coloring of graph $G$ is a proper coloring on the vertices of $G$ by $k$-colors such that every vertex $v$ of degree $d(v)$ is adjacent to vertices with at least $min\{d(v),r\}$ different color. ...
On $r$-Dynamic Coloring of Operation Product of Cycle and Path Graphs
(2016-02-18)
Let $G$ be a simple, connected and undirected
graph. Let $r,k$ be natural numbers. 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 ...