Metric dimension of structured networks with symmetry: Algorithms and applications

This study examines the metric dimension (MD) invariance in modified convex polytope structures, focusing on changes like adding [Formula: see text] times pendant edges and adding [Formula: see text] times prisms to the outer cycle of some convex polytope structures. MD, a key graph theory concept, has applications in network design, molecular analysis, and fault-tolerant systems. The research aims to examine that these modified polytopes have a constant MD, assess their computational complexity, and explore their applications in resilient system design. Results indicate that MD remains invariant, which aids in efficient vertex identification and supports applications in traffic management, power grids, and sensor network optimization. Overall, the study connects theoretical insights with practical uses, emphasizing the importance of invariant metric properties in advancing graph theory and its real-world applications.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2025-10-31
DOI
https://doi.org/10.1142/s1793830925501575
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Metric dimension of structured networks with symmetry: Algorithms and applications

Muhammad Ahmad, Zohaib Zahid, Sheeraz Mehboob
Discrete Mathematics Algorithms and Applications
Graph Labeling and Dimension Problems
article

Metric dimension of structured networks with symmetry: Algorithms and applications

Muhammad Ahmad, Zohaib Zahid, Sheeraz Mehboob
article en

Abstract

This study examines the metric dimension (MD) invariance in modified convex polytope structures, focusing on changes like adding [Formula: see text] times pendant edges and adding [Formula: see text] times prisms to the outer cycle of some convex polytope structures. MD, a key graph theory concept, has applications in network design, molecular analysis, and fault-tolerant systems. The research aims to examine that these modified polytopes have a constant MD, assess their computational complexity, and explore their applications in resilient system design. Results indicate that MD remains invariant, which aids in efficient vertex identification and supports applications in traffic management, power grids, and sensor network optimization. Overall, the study connects theoretical insights with practical uses, emphasizing the importance of invariant metric properties in advancing graph theory and its real-world applications.

Discrete Mathematics Algorithms and Applications
University of Management and Technology (PK)
Openalex Percentile: Top 67%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.