TY - JOUR

T1 - Computing the upper bounds for the metric dimension of cellulose network

AU - Imran, Shahid

AU - Siddiqui, Muhammad Kamran

AU - Imran, Muhammad

AU - Hussain, Muhammad

N1 - Publisher Copyright:
© 2019, Tsing Hua University. All rights reserved.

PY - 2019

Y1 - 2019

N2 - Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A set of vertices W resolves a graph G if every 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 and is denoted by dim(G). In this paper we study three dimensional chemical structure of cellulose network and then we converted it into planar chemical structure, consequently we obtained cellulose network graphs denoted by CLkn. We prove that dim(CLkn) ≤ 4 in certain cases.

AB - Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A set of vertices W resolves a graph G if every 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 and is denoted by dim(G). In this paper we study three dimensional chemical structure of cellulose network and then we converted it into planar chemical structure, consequently we obtained cellulose network graphs denoted by CLkn. We prove that dim(CLkn) ≤ 4 in certain cases.

UR - http://www.scopus.com/inward/record.url?scp=85077455151&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85077455151&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85077455151

SN - 1607-2510

VL - 19

SP - 585

EP - 605

JO - Applied Mathematics E - Notes

JF - Applied Mathematics E - Notes

ER -