ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a connected nontrivial graph GG of order nn, let a metric basis be a resolving set of minimum cardinality, let dim⁡(G)\dim(G) denote the metric dimension, and define bf(G)=∣⋂{B:B is a metric basis of G}∣\mathrm{bf}(G)=\left|\bigcap\{B:B\text{ is a metric basis of }G\}\right|. Determine the maximum possible value of bf(G)\mathrm{bf}(G) among connected graphs of order nn; in particular, establish the sharp upper bound bf(G)≤25(n−1)\mathrm{bf}(G)\leq \frac{2}{5}(n-1) (equivalently, bf(G)≤⌊2(n−1)5⌋\mathrm{bf}(G)\leq\left\lfloor\frac{2(n-1)}{5}\right\rfloor).

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.