Back to Search
Start Over
Metric Identification of Vertices in Polygonal Cacti.
- Source :
- CMES-Computer Modeling in Engineering & Sciences; 2023, Vol. 136 Issue 1, p883-899, 17p
- Publication Year :
- 2023
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- GRAPH connectivity
CACTUS
GEODESICS
Subjects
Details
- Language :
- English
- ISSN :
- 15261492
- Volume :
- 136
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- CMES-Computer Modeling in Engineering & Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 161262842
- Full Text :
- https://doi.org/10.32604/cmes.2023.025162