No Detail Found!

On Metric Dimension of Chemical Networks

Author(s)
Muhammad Hussain Department of Mathematics, COMSATS University Islamabad, Lahore Campus,,Pakistan
Saqib Nazeer Department of Mathematics, COMSATS University Islamabad, Lahore Campus,,Pakistan
Hassan Raza Department of Mathematics, COMSATS University Islamabad, Lahore Campus,,Pakistan
Abstract
Metric Dimension of any graph G is termed as the minimum number of basis element in the resolving set. Let G = (V, E) be any connected graph and length of the shortest path between s and h is known as distance, denoted by d(s, h) in G. Let B = {b1, b2, ..., bq} be any ordered subset of V and representation r(u|B) with respect to B is the q - tuple (d(u, b1), d(u, b2), d(u, b3), ..., d(u, bq)}, here B is called the resolving set or the locating set if every vertex of G is uniquely represented by distances from the vertices of B or if distinct vertices of G have distinct representations with respect to B. Any resolving set containing minimum cardinality is named as basis for G and its cardinality is the metric dimension of G is denoted by dim(G). We investigated metric dimension of Polythiophene Network, Backbone Network, Hex-derive Network and N ylone6,6.
Publication Details
Page(s) 18-27
DOI DOI not available
Published Journal: Journal of Prime Research in Mathematics, Volume: 18, Issue: 1, Year: 2022

Request the full text from PASTIC

Keywords
distance, 2010 MSC, Graphs, Metric dimension, 05C15, 05C12, Resolving sets, 05C62, Chemical network
0

Citations

0

Downloads

42

Views