On the Metric Dimension of Barycentric Subdivision of Cayley Graphs

作     者：Muhammad IMRAN 

作者机构：Department of Mathematics School of Natural Sciences National University of Sciences and Technology Sector H-12 Islamabad Pakistan 

出 版 物：《Acta Mathematicae Applicatae Sinica》 (应用数学学报（英文版）)

年 卷 期：2016年第32卷第4期

页      面：1067-1072页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the National University of Sciences and Technology(NUST) H-12 Islamabad Pakistan 

主　　题：metric dimension basis resolving set barycentric subdivision Cayley graph 

摘      要：In a connected graph G, the distance d（u, v） denotes the distance between two vertices u and v of G. Let W = {w1, w2,……, wk} be an ordered set of vertices of G and let v be a vertex of G. The representation r（v1W） of v with respect to W is the k-tuple （d（v, w1）, d（v, w2）,…, d（v, wk））. The set W is called a resolving set or a locating set if every vertex of G is uniquely identified by its distances from the vertices of W, or equivalently, if distinct vertices of G have distinct representations with respect to W. A resolving set of minimum cardinality is called a metric basis for G and this cardinality is the metric dimension of G, denoted by β（G）. Metric dimension is a generalization of affine dimension to arbitrary metric spaces （provided a resolving set exists）. In this paper, we study the metric dimension of barycentric subdivision of Cayley graphs Cay （Zn Z2）. We prove that these subdivisions of Cayley graphs have constant metric dimension and only three vertices chosen appropriately suffice to resolve all the vertices of barycentric subdivision of Cayley graphs Cay （Zn Z2）.