We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/Metric dimension of fullerene graphs
PeriodicalsComputer Science & Information Technology

Metric dimension of fullerene graphs

Checking your access to this record.

Abstract & Overview

A resolving set W is a set of vertices of a graph G ( V , E ) such that for every pair of distinct vertices u , v ∈ V ( G ) , there exists a vertex w ∈ W satisfying d ( u , w ) ≠ d ( v , w ) . A resolving set with minimum number of vertices is called metric basis of G . The metric dimension of G , denoted by dim( G ) , is the minimum cardinality of a resolving set of G . In this paper, we consider (3, 6) -fullerene and (4, 6) -fullerene graphs and compute the metric dimension for these fullerene graphs. We also give conjecture on the metric dimension of (3, 6) -fullerene and (4, 6) -fullerene graphs.

Cite this record

Shehnaz Akhter, Rashid Farooq (2019). Metric dimension of fullerene graphs. Electronic Journal of Graph Theory and Applications, 7(1), 91–103. https://doi.org/10.5614/ejgta.2019.7.1.7

Copy in another style

Akhter, S., & Farooq, R. (2019). Metric dimension of fullerene graphs. Electronic Journal of Graph Theory and Applications, 7(1), 91–103. https://doi.org/10.5614/ejgta.2019.7.1.7
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.