图的最小容错维数、局部维数和强度量维数
Minimum Fault-Tolerant, local and strong metric dimension of graphs
摘要：
本文考虑了三个相似的最优化问题：容错度量维数问题、局部度量维数问题和强度量维数问题。这些问题在许多不同的领域，包括网络发现和验证，机器人导航和化学等，我们给整数线性规划制定的容错度量维数问题和局部度量维数问题的应用。同时，我们还研究了两个凸多胞体$S_n$和$U_n$的局部度量维数和强度量维数。
英文摘要：
In this paper, we consider three similar optimization problems: the fault-tolerant metric dimension problem, the local metric dimension problem and the strong metric dimension problem. These problems have applications in many diverse areas, including network discovery and verification, robot navigation and chemistry, etc. We give integer linear programming formulations of the fault-tolerant metric dimension problem and the local metric dimension problem. Also, we study local metric dimension and strong metric dimension of two convex polytopes $S_n$ and $U_n$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
