SECURE METRIC DIMENSION OF ALTERNATE SNAKE GRAPHS
We study the NP-hard problem of determining the secure metric dimension of graphs. A resolving set uniquely identifies each vertex by its distance vector to the set; the smallest is the metric basis, and its size is the metric dimension. A set is secure if each outside vertex can replace an inside...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mechanics of Continua and Mathematical Sciences
2025-05-01
|
| Series: | Journal of Mechanics of Continua and Mathematical Sciences |
| Subjects: | |
| Online Access: | https://jmcms.s3.amazonaws.com/wp-content/uploads/2025/05/14191738/jmcms-2505011-Secure-Metric-Dimension-Batiha.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|