Abstract
Let be a simple, connected, and undirected graph. The distance between two vertices denoted by , is the length of the shortest path connecting u and v. A subset of vertices is said to be a resolving set for G if for any two distinct vertices V, there exist a vertex such that . A minimal resolving set is called a metric basis, and the cardinality of the basis set is called the metric dimension of G, denoted by . In this article, we find the metric dimension for two infinite families of plane graphs and , where is obtained by the combination of copies of bipartite graphs , and is obtained by the combination of double antiprism graph with antiprism graph and then adding n-paths of length p.
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: International Journal of Computer Mathematics: Computer Systems Theory
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.
