Open AccessOn The Metric Index of Oxide Networks
Author(s) -
R. Nithya Raj 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.k1305.0981119
Subject(s) - combinatorics , vertex (graph theory) , mathematics , metric (unit) , cardinality (data modeling) , metric dimension , connectivity , discrete mathematics , graph , premise , computer science , data mining , chordal graph , linguistics , operations management , philosophy , 1 planar graph , economics
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.