The vertex metric dimension bound for connected graphs
Statement
Let be a connected graph. The invariant is the graph parameter measuring the contribution of leaves, and is the cyclomatic number of . The vertex metric dimension bound conjecture.
This extends the corresponding bound known for cactus graphs to all connected graphs. The source gives no resolution of the conjecture.
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.