Maximum number of vertices in every metric basis
Statement
For a connected nontrivial graph of order , let a metric basis be a resolving set of minimum cardinality, let denote the metric dimension, and define . Determine the maximum possible value of among connected graphs of order ; in particular, establish the sharp upper bound (equivalently, ).
Record
- Added
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.