Fault-tolerant resolvability of oxide interconnections

Abstract

A collection of well-defined set W={w1, w2, …, wk} of nodes of a graph G is named as a resolving set, if all the nodes of G are distinctively identified by the ordered set of distances to the nodes in W. The metric index of G is the smallest cardinality of a resolving set of G. A resolving set W for G is called fault-tolerant if W\{wi} is also a resolving set, for each wi in W. The smallest cardinality of such a set is called fault-tolerant metric index of G. In this paper fault-tolerant metric index of oxide interconnection is found.