首页 /研究 /Fault‐Tolerant Resolvability in Some Classes of Subdivision Graphs
OTHER

Fault‐Tolerant Resolvability in Some Classes of Subdivision Graphs

Muhammad Rehan Faheem, Zohaib Zahid, Dalal Alrowaili, Imran Siddique, Aiyared Iampan

发表年份
2022
引用次数
6
访问权限
开放获取

摘要

The concept of resolving sets (RSs) and metric dimension (MD) invariants have a wide range of applications in robot navigation, computer networks, and chemical structure. RS has been used as a sensor in an indoor positioning system to find an interrupter. Many terminologies in machine learning have also been used to diagnose the interrupter in the systems of marine and gas turbines using sensory data. We proposed a fault‐tolerant self‐stable system that allows for the detection of an interrupter even if one of the sensors in the chain fails. If the elimination of any element from a RS is still a RS, then the RS is considered as a fault‐tolerant resolving set (FTRS), and the fault‐tolerant metric dimension (FTMD) is its minimum cardinality. In this paper, we calculated the FTMD of the subdivision graphs of the necklace and prism graphs. We also found that this invariant has constant values for both graphs.

关键词

SubdivisionCardinality (data modeling)Invariant (physics)Metric (unit)Dimension (graph theory)Computer scienceMathematicsGraphAlgorithmSet (abstract data type)

相关论文

查看 OTHER 分类全部论文