Search
Now showing items 21-25 of 25
The Antimagicness of Super (a, d) - P2⊵̇H Total Covering on Total Comb Graphs
(2018-10-29)
A graph can be constructed in several ways. One of them is by operating two or more graphs. The resulting graphs will
be a new graph which has certain characteristics. One of the latest graph operations is total comb of ...
On Super Local Antimagic Total Edge Coloring of Some Wheel Related Graphs
(2018-10-29)
Let G be a connected graph, let V(G) be the vertex set of graph G, and let
E(G) be the edge set of graph G. Thus, the
bijective function f : V(G) ∪ E(G) −→ {1, 2, 3, ..., |V(G)| + |E(G)|} is called a local antimagic ...
Non-Isolated Resolving Number of Graphs with Homogeneous Pendant Edges
(2018-10-29)
A set is called a resolving set of if every vertices of have
diff erent r epr esentation. The minimum cardinalit y of resolving set is metric dimension, denoted by .
Furthermore, the resolving set of is called ...
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 ...