ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph. The invariant L(G)L(G) is the graph parameter measuring the contribution of leaves, and c(G)c(G) is the cyclomatic number of GG. The vertex metric dimension bound conjecture.

dim(G)≤L(G)+2c(G).\mathrm{dim}(G)\leq L(G)+2c(G).

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 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.