Search
Now showing items 1-5 of 5
The non-isolated resolving number of k-corona product of graphs
(2018-07-04)
Let all graphs be a connected and simple graph. A set W = fw
g
of veretx set of G, the kvector ordered r(vjW) = (d(x; w
1
); d(x; w
2
1
; w
2
); : : : ; d(x; w
)) of is a
representation of v with respect to W, ...
On the local edge antimagicness of m-splitting graphs
(2018-07-03)
Let G be a connected and simple graph. A split graph is a graph derived by adding
new vertex v
0
in every vertex v such that v
0
adjacent to v in graph G. An m-splitting graph
is a graph which has m v
0
-vertices, ...
On the total rainbow connection of the wheel related graphs
(2018-07-04)
Let G = (V (G); E(G)) be a nontrivial connected graph with an edge coloring
c : E(G) ! f1; 2; :::; lg; l 2 N, with the condition that the adjacent edges may be colored by
the same colors. A path P in G is called rainbow ...
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 ...
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 ...