Metric Identification of Vertices in Polygonal Cacti

作     者：Xiujun Zhang Muhammad Salman Anam Rani Rashna Tanveer Usman Ali Zehui Shao 

作者机构：School of Computer ScienceChengdu UniversityChengduChina Department of MathematicsThe Islamia University of BahawalpurBahawalpurPakistan Centre for Advanced Studies in Pure and Applied MathematicsBahauddin Zakariya UniversityMultanPakistan Institute for Intelligent Information ProcessingSouth China Business College of Guangdong University of Foreign StudiesGuangzhouChina 

出 版 物：《Computer Modeling in Engineering & Sciences》 (工程与科学中的计算机建模（英文）)

年 卷 期：2023年第136卷第7期

页      面：883-899页

核心收录：

学科分类：08[工学] 080203[工学-机械设计及理论] 0802[工学-机械工程] 

主　　题：Metric metric identification metric generator metric dimension cactus graph 

摘      要：The distance between two vertices u and v in a connected graph G is the number of edges lying in a shortest path(geodesic)between them.A vertex x of G performs the metric identification for a pair(u,v)of vertices in G if and only if the equality between the distances of u and v with x implies that u=v(That is,the distance between u and x is different from the distance between v and x).The minimum number of vertices performing the metric identification for every pair of vertices in G defines themetric dimension of *** this paper,we performthemetric identification of vertices in two types of polygonal cacti:chain polygonal cactus and star polygonal cactus.