The exact (k+1)(k+1)-metric dimension of three-dimensional grids

From papers

Let k,n1,n2,n32k,n_1,n_2,n_3\ge 2, and let Pn1Pn2Pn3P_{n_1}\Box P_{n_2}\Box P_{n_3} be the three-dimensional grid graph. Write αm(n1,n2,n3)\alpha_m(n_1,n_2,n_3) and αM(n1,n2,n3)\alpha_M(n_1,n_2,n_3) for the quantities defined in the paper, and let dimk+1\dim_{k+1} denote the (k+1)(k+1)-metric dimension.

The conjecture. If

αm(n1,n2,n3)k<αM(n1,n2,n3),\alpha_m(n_1,n_2,n_3)\le k<\alpha_M(n_1,n_2,n_3),

then

dimk+1(Pn1Pn2Pn3)=min{4k2αm(n1,n2,n3)+4, n1n2n3(n12)(n22)(n32)}.\dim_{k+1}(P_{n_1}\Box P_{n_2}\Box P_{n_3})=\min\left\{4k-2\alpha_m(n_1,n_2,n_3)+4,\ n_1n_2n_3-(n_1-2)(n_2-2)(n_3-2)\right\}.

The preceding results determine the exact value when k<αm(n1,n2,n3)k<\alpha_m(n_1,n_2,n_3) and show that the displayed upper bound holds throughout the remaining range where a (k+1)(k+1)-resolving set exists. The conjecture proposes the exact value in the intermediate range αm(n1,n2,n3)k<αM(n1,n2,n3)\alpha_m(n_1,n_2,n_3)\le k<\alpha_M(n_1,n_2,n_3); when αm=αM\alpha_m=\alpha_M, which occurs if min{n1,n2,n3}=2\min\{n_1,n_2,n_3\}=2, the metric dimension is already completely determined.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Mercè Mora, María José Souto Salorio and Ana Dorotea Tarrío-Tobar, “Resolving sets tolerant to failures in three-dimensional grids”, arXiv:2112.08768 (2021).

Solutions 0

No solutions have been posted yet.