Search
Now showing items 1-10 of 81
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)|\}$, ...
Open Problems in the Construction of Large Directed Graphs
(Proceedings of the sixteenth Australasian Workshop on Combinatorial Algoritms, 2005-09-15)
In this paper we consider the problem of how to construct directed graphs
with given maximum out-degree and diameter. To deal with this problem, we describe
several construction techniques. These fall into three broad ...
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)$, ...
Undur-Undur Darat (Myrmeleon sp.) sebagai Obat Alternatif Diabetes Melitus
(2015-03-17)
Diabetes Melitus adalah golongan penyakit kronis yang ditandai dengan peningkatan kadar gula dalam darah sebagai akibat adanya gangguan sistem metabolisme dalam tubuh, dimana organ pankreas tidak mampu memproduksi hormon ...
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,
...
Antimagic Total labeling of Disjoint Union of Disconnected Graph
(CSS Jember, National Library : Katalog Dalam Terbitan (KDT), 2013-04-02)
A network topology (either communication network in
general or a network in a computer) can be modeled as a graph or a
directed graph (digraph, for short), where each processing element
is represented by a vertex and ...
On diregularity of digraphs of defect two
(The University of Newcastle Australia, 2007-11-05)
Since Moore digraphs do not exist for k /= 1 and d /= 1,
the problem of finding the existence of digraph of out-degree d >= 2
and diameter k >= 2 and order close to the Moore bound becomes an
interesting problem. To ...