On The Metric Index of Oxide Networks
R. Nithya Raj1, F. Simon Raj2
1R. Nithya Raj1F, Department of Mathematics Hindustan Institute of Technology and Science Chennai 603-103 India.
2Simon Raj, Department of Mathematics Hindustan Institute of Technology and Science Chennai 603-103 India.
Manuscript received on 26 August 2019. | Revised Manuscript received on 06 September 2019. | Manuscript published on 30 September 2019. | PP: 2422-2429 | Volume-8 Issue-11, September 2019. | Retrieval Number: K13050981119/2019©BEIESP | DOI: 10.35940/ijitee.K1305.0981119
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Let be wi 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. Catchphrases: Metric premise ,Metric index ,Oxide network, Interconnection Network.
Keywords: Metric premise ,Metric index ,Oxide network, Interconnection Network.
Scope of the Article: Networking Theory and Technologies