Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronic Journal of Graph Theory and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
