Metric Identification of Vertices in Polygonal Cacti  

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

机构地区：[1]School of Computer Science,Chengdu University,Chengdu,China [2]Department of Mathematics,The Islamia University of Bahawalpur,Bahawalpur,Pakistan [3]Centre for Advanced Studies in Pure and Applied Mathematics,Bahauddin Zakariya University,Multan,Pakistan [4]Institute for Intelligent Information Processing,South China Business College of Guangdong University of Foreign Studies,Guangzhou,China

出　　处：《Computer Modeling in Engineering & Sciences》2023年第7期883-899,共17页工程与科学中的计算机建模（英文）

摘　　要：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 G.In this paper,we performthemetric identification of vertices in two types of polygonal cacti:chain polygonal cactus and star polygonal cactus.

关 键 词：METRIC metric identification metric generator metric dimension cactus graph 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]