On the metric index of oxide networks

Abstract

Let be a vertex of a connected simple graph and be a pair of vertices in G. let ) be the distance between and A vertex is said to resolve and if. A set of vertices W of G is called a settling set of Gif every pair of vertices resolved by atleast one vertices. A settling set of G with least cardinality is called metric premise of G. The cardinality of metric premise is called metric index of G. In this paper metric index of oxide network is investigated.