Truncated metric dimension for finite graphs
Truncated metric dimension for finite graphs
复制标题
有限图的截断公制维度
DOI:
10.1016/j.dam.2022.04.021
复制
发表时间:
2022
影响因子:
1.1
通讯作者:
Yi, Eunjeong
中科院分区:
文献类型:
--
作者:
Frongillo, Rafael M.;Geneson, Jesse;Lladser, Manuel E.;Tillquist, Richard C.;Yi, Eunjeong
Let G be a graph with vertex set V (G), and let d (x, y) denote the length of a shortest path between nodes x and y in G. For a positive integer k and for distinct x, y∈ V (G), let d k (x, y)= min {d (x, y), k+ 1} and R k {x, y}={z∈ V (G): d k (x, z)≠ d k (y, z)}. A subset S⊆ V (G) is a k-truncated resolving set of G if| S∩ R k {x, y}|≥ 1 for any pair of distinct x, y∈ V (G). The k-truncated metric dimension, dim k (G), of G is the minimum cardinality over all k-truncated resolving sets of G, and the usual metric dimension is recovered when k+ 1 is at least the diameter of G. We obtain some general bounds for k-truncated metric dimension. For all k≥ 1, we characterize connected graphs G of order n with dim k (G)= n− 2 and dim k (G)= n− 1. For all j, k≥ 1, we find the maximum possible order, degree, clique number, and chromatic number of any graph G with dim k (G)= j. We determine dim k (G) when G is a cycle or a path. We also examine the effect of vertex or edge deletion on the truncated metric dimension of graphs, and study various problems related to the truncated metric dimension of trees.
登录
查看更多内容
影响因子:
1.1
作者:
Fernau, Henning;Rodriguez-Velazquez, Juan A.
通讯作者:
Rodriguez-Velazquez, Juan A.
DOI:
--
发表时间:
2002
期刊:
影响因子:
--
作者:
C. Poisson;Ping Zhang
通讯作者:
Ping Zhang
DOI:
10.4310/joc.2015.v6.n4.a2
发表时间:
2015
期刊:
The Journal of Combinatorics
影响因子:
--
作者:
Linda Eroh;P. Feit;Cong X. Kang;Eunjeong Yi
通讯作者:
Eunjeong Yi
影响因子:
1.1
作者:
Jesse T. Geneson
通讯作者:
Jesse T. Geneson
DOI:
--
发表时间:
2021
期刊:
影响因子:
--
作者:
Jesse T. Geneson;Eunjeong Yi
通讯作者:
Eunjeong Yi