arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.07335math.CO
收藏

关于2-连通图的点和边度量维数的注记

Remarks on the vertex and the edge metric dimension of 2-connected graphs

Martin Knor, Jelena Sedlar, Riste Škrekovski

摘要:

顶点(resp.边)度量维数是图G中区分所有顶点对的最小顶点集的大小。边),并表示为dim(G)(resp. edim(G))。建立了无叶仙人掌的上界dim(G)≤ 2c(G)-1和edim(G)≤ 2c(G)-1(其中c(G)表示G的圈数),并刻画了所有达到上界的无叶仙人掌.进一步证明了对于一般的无叶连通图也有相同的界,并且证明了问题可归结为2-连通图,从而支持了这一猜想.本文研究了不同于圈的最简单的2-连通图Theta图,证明了Theta图的两个度量维数的上界2c(G)-1成立,并刻画了所有达到上界的Theta图.我们的结论是,在无叶图类中,除了已知的极仙人掌图和极Theta图外,不存在其它的关于2c(G)- 1界的极图.

英文摘要:

The vertex (resp. edge) metric dimension of a graph G is the size of a smallest vertex set in G which distinguishes all pairs of vertices (resp. edges) in G and it is denoted by dim(G) (resp. edim(G)). The upper bounds dim(G) <= 2c(G) - 1 and edim(G) <= 2c(G)-1; where c(G) denotes the cyclomatic number of G, were established to hold for cacti without leaves distinct from cycles, and moreover all leafless cacti which attain the bounds were characterized. It was further conjectured that the same bounds hold for general connected graphs without leaves and this conjecture was supported by showing that the problem reduces to 2-connected graphs. In this paper we focus on Theta graphs, as the most simple 2-connected graphs distinct from cycle, and show that the the upper bound 2c(G) - 1 holds for both metric dimensions of Theta graphs and we characterize all Theta graphs for which the bound is attained. We conclude by conjecturing that there are no other extremal graphs for the bound 2c(G) - 1 in the class of leafless graphs besides already known extremal cacti and extremal Theta graphs mentioned here.

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

↑