Open AccessFault-Tolerant Resolvability of Oxide Interconnections
Author(s) -
M. Somasundari*,
F.Simon Raj
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.l3245.1081219
Subject(s) - cardinality (data modeling) , set (abstract data type) , fault tolerance , metric (unit) , graph , computer science , index (typography) , mathematics , discrete mathematics , combinatorics , distributed computing , data mining , engineering , operations management , world wide web , programming language
A collection of well-defined set W= , , … , 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 faulttolerant if \ is also a resolving set, for each 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