Search
Now showing items 1-5 of 5
On Super Edge Local Antimagic Total Labeling by Using an Edge Antimagic Vertex Labeling Technique
(2019-07-25)
In this paper, we consider that all graphs are finite, simple and connected. Let G(V,E) be a graph of vertex set V and edge set E. By a edge local antimagic total labeling, we mean a bijection f:V(G)∪E(G)→{1,2,3,...,|V(G)|+|E(G)|} ...
Non-Isolated Resolving Number of Graph with Pendant Edges
(2019-07-25)
We consider V; E are respectively vertex and edge sets of a simple, nontrivial and connected graph
G. For an ordered set W = fw
g of vertices and a vertex v 2 G, the ordered
r(vjW) = (d(v; w
1
); d(v; w
2
1
; w
2
; ...
Implementation of Super H-antimagic Total graph on Establishing Stream Cipher
(2019-07-12)
This paper is aimed to study the use of super (a; d)-H antimagic total graph on generating en-
cryption keys that can be used to establish a stream cipher. Methodology to achieve this goal
was undertaken in three steps. ...
The Local Multiset Dimension of Graphs
(2019-09-02)
All graphs in this paper are nontrivial and connected graph. For 𝑘-ordered set 𝑊 = {𝑠1, 𝑠2, … , 𝑠𝑘} of vertex set 𝐺, the multiset representation
of
a
vertex
𝑣
of
𝐺
with
respect
to
𝑊
is
𝑟𝑚(𝑣|𝑊)
= ...
On The LDS of the Joint Product of Graphs
(2019-09-02)
Locating dominating set (LDS) is one of the topics of graph theory.
A set VD
of vertices in graph G is called a dominating set if every
vertex V
u
is either an element of D or adjacent to some element ...