Fault-Tolerant Resolvability of Certain Crystal Structures

HTML  XML Download Download as PDF (Size: 597KB)  PP. 599-604  
DOI: 10.4236/am.2016.77055    2,662 Downloads   3,777 Views  Citations
Author(s)

ABSTRACT

An ordered set W of vertices of a graph G is called a resolving set, if all the vertices of G are uniquely determined by the vector of distances to the vertices in W. The metric dimension of G is the minimum cardinality of a resolving set of G. A resolving set W for G is fault-tolerant if W\{v} is also a resolving set, for each v in W, and the fault-tolerant metric dimension of G is the minimum cardinality of such a set. In this paper we determine the metric dimension and fault-tolerant metric dimension problems for the graphs of certain crystal structures.

Share and Cite:

Krishnan, S. and Rajan, B. (2016) Fault-Tolerant Resolvability of Certain Crystal Structures. Applied Mathematics, 7, 599-604. doi: 10.4236/am.2016.77055.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.