Search
Now showing items 1-4 of 4
Local Edge Antimagic Coloring of Comb Product of Graphs
(2018-07-03)
All graph in this paper are ¯nite, simple and connected graph. Let
G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡!
f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling if for any ...
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 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 ...