M. Hussain and Aqsa Farooq
Metric Dimension on Line Graph of Honeycomb Networks
207 - 212
2019
13
11
International Journal of Mathematical and Computational Sciences
https://publications.waset.org/pdf/10010901
https://publications.waset.org/vol/155
World Academy of Science, Engineering and Technology
Let G (V,E) be a connected graph and distance
between any two vertices a and b in G is a&minus;b geodesic and is denoted
by d(a, b). A set of vertices W resolves a graph G if each vertex is
uniquely determined by its vector of distances to the vertices in W.
A metric dimension of G is the minimum cardinality of a resolving
set of G. In this paper line graph of honeycomb network has been
derived and then we calculated the metric dimension on line graph
of honeycomb network.
Open Science Index 155, 2019