跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2608.24336 · v2

On the Maximum Number of Vertices that Belong to Every Metric Basis

首次提交 2026-08-25 18:00
版本更新 2026-11-19 20:01
雷达观测 2026-11-20 16:53
arXiv ↗PDF ↗

摘要

Resolving sets of graphs have been widely studied since their introduction in the 1970's by Slater and, independently, by Harary and Melter. The minimum cardinality of a resolving set of a graph GG is called the metric dimension of GG and is denoted by dim⁡(G)\dim(G). In this paper, we concentrate on the existence of vertices in a graph GG that belong to all metric bases of GG, i.e. resolving sets of cardinality dim⁡(G)\dim(G). Such vertices are called basis forced vertices, and we denote the number of them by bf(G)\mathrm{bf}(G). We show that bf(G)≤2/3(n−dim⁡(G)−1)\mathrm{bf}(G)\le 2/3(n-\dim(G)-1) for any connected nontrivial graph GG of order nn. In addition, we show that this bound can be attained. Furthermore, it also implies that bf(G)≤2/5(n−1)\mathrm{bf}(G)\le 2/5(n-1) holds for any nontrivial connected graph GG. This result answers a question posed by Bagheri \emph{et al.} in 2016. Moreover, we provide a complete realization of the parameters nn, dim⁡(G)\dim(G) and bf(G)≥1\mathrm{bf}(G) \ge 1 within the previous bounds. We consider some extremal cases related to basis forced vertices in a graph, in particular, we give a full characterization of the graphs with bf(G)=2\mathrm{bf}(G) = 2 and dim⁡(G)=n−4\dim(G) = n-4.

作者备注:20 pages, 8 figures. Parts of this paper appeared in CALDAM 2025

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-19 20:01 · 最新观测版本

On the Maximum Number of Vertices that Belong to Every Metric Basis

Resolving sets of graphs have been widely studied since their introduction in the 1970's by Slater and, independently, by Harary and Melter. The minimum cardinality of a resolving set of a graph GG is called the metric dimension of GG and is denoted by dim⁡(G)\dim(G). In this paper, we concentrate on the existence of vertices in a graph GG that belong to all metric bases of GG, i.e. resolving sets of cardinality dim⁡(G)\dim(G). Such vertices are called basis forced vertices, and we denote the number of them by bf(G)\mathrm{bf}(G). We show that bf(G)≤2/3(n−dim⁡(G)−1)\mathrm{bf}(G)\le 2/3(n-\dim(G)-1) for any connected nontrivial graph GG of order nn. In addition, we show that this bound can be attained. Furthermore, it also implies that bf(G)≤2/5(n−1)\mathrm{bf}(G)\le 2/5(n-1) holds for any nontrivial connected graph GG. This result answers a question posed by Bagheri \emph{et al.} in 2016. Moreover, we provide a complete realization of the parameters nn, dim⁡(G)\dim(G) and bf(G)≥1\mathrm{bf}(G) \ge 1 within the previous bounds. We consider some extremal cases related to basis forced vertices in a graph, in particular, we give a full characterization of the graphs with bf(G)=2\mathrm{bf}(G) = 2 and dim⁡(G)=n−4\dim(G) = n-4.

查看此版本解读 →查看此版本原文 ↗