Tree equidistant dimension conjecture
Statement
Let be a tree of order , and let denote the path on vertices. The equidistant dimension of a graph, denoted by , is the minimum cardinality of a distance-equalizer set.
Tree equidistant dimension conjecture.
The conjecture proposes that among all trees of order , the path has maximum equidistant dimension. The exact value of the equidistant dimension of trees is not known, although the path is suggested by the fact that every pair of vertices in a path has at most one equidistant vertex.
Record
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.