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, ...
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
; ...
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
𝑟𝑚(𝑣|𝑊)
= ...