Search
Now showing items 1-2 of 2
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
𝑟𝑚(𝑣|𝑊)
= ...