Search
Now showing items 1-3 of 3
Metric Chromatic Number of Unicyclic Graphs
(INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 06, JUNE 2019, 2019-06-09)
All graphs in this paper are nontrivial and connected graph. Let 𝑓 ∶ 𝑉 (𝐺) → *1,2, … , 𝑘+ be a vertex coloring of a graph 𝐺where two adjacent
vertices may be colored the same color. Consider the color classes Π = ...
On the Local Multiset Dimension of Graph With Homogenous Pendant Edges
(Journal of Physics: Conference Series, 2019-12-01)
Let G be a connected graph with E as edge set and V as vertex set . rm(v|W) =
{d(v, s1), d(v, s2), . . . , d(v, sk)} is the multiset representation of a vertex v of G with respect to
W where d(v, si) is a distance between ...
The Local (Adjacency) Metric Dimension of Split Related Complete Graph
(IOP Conf. Series: Journal of Physics: Conf. Series, 2019-04-01)
Let G be a simple graph. A set of vertices, called V (G) and a set of edges, called
E(G) are two sets which form graph G. W is a local adjacency resolving set of G if for every
two distinct vertices x, y and x adjacent ...