\r\nbetween any two vertices a and b in G is a−b geodesic and is denoted

\r\nby d(a, b). A set of vertices W resolves a graph G if each vertex is

\r\nuniquely determined by its vector of distances to the vertices in W.

\r\nA metric dimension of G is the minimum cardinality of a resolving

\r\nset of G. In this paper line graph of honeycomb network has been

\r\nderived and then we calculated the metric dimension on line graph

\r\nof honeycomb network.","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 155, 2019"}