arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.12199cs.DMmath.CO
收藏

叶less刺状图的容错度量维度及其在供应链管理中的应用

Fault Tolerant Metric Dimensions of Leafless Cacti Graphs with Application in Supply Chain Management

The University of Haripur(哈里普尔大学);National University of Sciences and Technology(国立科学与技术大学)

Tauseef Asif, Ghulam Haidar, Faisal Yousafzai, Murad Ul Islam Khan, Qaisar Khan, Rakea Fatima

AI总结:

本文研究了叶less刺状图的容错度量维度,确定了双环图类型I和II的容错度量维度恒为4,并探讨了其在供应链管理中的应用。

摘要:

对于简单图G,分辨集是G的顶点集的一个子集,通过该子集到各顶点的最短距离来区分所有顶点。如果从该子集移除任意一个顶点后,它仍然保持分辨集的性质,则称为容错分辨集。最小的满足此性质的集合称为容错度量基,其大小称为G的容错度量维度,记为β'(G)。本文确定了双环图类型I和II的容错度量维度,并证明对于这两种类型的图,其值恒为4。随后,我们利用这些结果作为基础,考虑叶less刺状图,并以内环和外环来计算其容错度量维度。然后,我们考虑了一个详细的现实世界供应链和配送中心管理示例,并讨论了容错度量维度在该场景中的应用。此外,我们还简要讨论了叶less刺状图在其他现实世界问题建模中的应用。

英文摘要:

A resolving set for a simple graph $G$ is a subset of vertex set of $G$ such that it distinguishes all vertices of $G$ using the shortest distance from this subset. This subset is a metric basis if it is the smallest set with this property. A resolving set is a fault tolerant resolving set if the removal of any vertex from the subset still leaves it a resolving set. The smallest set satisfying this property is the fault tolerant metric basis, and the cardinality of this set is termed as fault tolerant metric dimension of $G$, denoted by $β'(G)$. In this article, we determine the fault tolerant metric dimension of bicyclic graphs of type-I and II and show that it is always $4$ for both types of graphs. We then use these results to form our basis to consider leafless cacti graphs, and calculate their fault tolerant metric dimensions in terms of \textit{inner cycles} and \textit{outer cycles}. We then consider a detailed real world example of supply and distribution center management, and discuss the application of fault tolerant metric dimension in such a scenario. We also briefly discuss some other scenarios where leafless cacti graphs can be used to model real world problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑