Abstract
Let G(V,E) be a graph with a set of vertices V and a set of edges E. Then, a minimum subset Wl of V is said to be a local metric basis of G if for any two adjacent vertices u,v∈V∖Wl there exists a vertex w∈Wl such that d(u,w) ≠ d(v,w). The cardinality of a local metric basis is referred to as the local metric dimension of the graph G denoted by βl(G). In this paper, we investigate the local metric dimensions of certain circulant-related architectures such as Harary graphs Hk,n with even k or n, Toeplitz networks, and ILLIAC networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Advanced Computational Intelligence and Intelligent Informatics
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.