TY - JFULL
AU - M. Hussain and Aqsa Farooq
PY - 2019/12/
TI - Metric Dimension on Line Graph of Honeycomb Networks
T2 - International Journal of Mathematical and Computational Sciences
SP - 196
EP - 202
VL - 13
SN - 1307-6892
UR - https://publications.waset.org/pdf/10010901
PU - World Academy of Science, Engineering and Technology
NX - Open Science Index 155, 2019
N2 - Let G = (V,E) be a connected graph and distance
between any two vertices a and b in G is a−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.
ER -