Search
Now showing items 31-33 of 33
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 ...
The construction of encryption key by using a super H-antimagic total graph
(2018-04-30)
The strength of cryptosystem relays on the management of encryption key. The
key should be managed such that it is hard for any intruder to analyze the key. Thus, the
main issue is how to make the relation between ...
Super (a, d)-Cycles-Antimagic Labeling of Subdivision of a Fan Graph
(2018-12-21)
We consider a simple, connected and undirected graph ( )EVG , with
vertex set
()GV and edge set ( ).GE There is a super ( ) H-, da -
antimagic total labeling on the graph ( )EVG , if there exists
a ...