Evidence map›Paper›PMID 41998002›Full record

ArticleScientific reports2026

Structural identifiability in crystalline molecular networks using strong metric dimension.

Muhammad Imran, Muhammad Salman, Tahoor Tahoor, Faisal Ali, Roslan Hasni

Abstract read
In one paragraph

Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Muhammad ImranDepartment of Electrical Engineering, Prince Mohammad Bin Fahd University (PMU), P. o. Box 1664, Al Khobar, 31952, Saudi Arabia. imrandhab@gmail.com.
Muhammad SalmanDepartment of Mathematics, The Islamia University of Bahawalpur, Bahawalpur, 63100, Pakistan.
Tahoor TahoorDepartment of Mathematics, The Islamia University of Bahawalpur, Bahawalpur, 63100, Pakistan.
Faisal AliCenter for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, Multan, 60800, Pakistan.
Roslan HasniSpecial Interest Group of Modeling and Data Analytics, Faculty of Computer Science and Mathematics, Universiti Malaysia Terengganu, 21030, Kuala Nerus, Terengganu, Malaysia.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Structural identifiability in crystalline molecular systems can be examined using graph-theoretic distance measures that capture the uniqueness of vertex positions within molecular networks. In this study, we investigate the strong metric dimension (SMD) of two crystalline frameworks, the Benzenoid Tripod and Bismuth Tri-Iodide chain, as representative models for aromatic and inorganic lattices. A vertex strongly identifies a pair of vertices if it lies on a shortest path between them, and the minimal set of such vertices defines the SMD of the network. By employing the Oellermann-Fransen approach, the strong resolving graphs of both crystalline networks are constructed, and the vertex-cover method is applied to obtain exact SMD values. Analytical derivations reveal structural patterns linking the topology of benzenoid rings and bismuth-iodide layers to their identification capacities. The results indicate that the SMD serves as a quantifier of information completeness within crystalline graphs, analogous to connectivity measures used in cheminformatics and network science. A conjecture is further proposed for the two-dimensional bismuth tri-iodide sheet, offering a pathway toward generalized formulations for layered crystalline materials. The proposed framework bridges discrete mathematics and molecular modeling, demonstrating how strong metric identification can support structural verification, nano-design, and data-driven exploration of chemical networks.

Indexed as

Crystalline structureMetricMetric identificationStrong metric identificationStrong resolving graphVertex cover number

Identifiers

PMID41998002
PMCPMC13454305

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.