ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every connected graph GG that is not a cycle, the mixed metric dimension satisfies mdim⁡(G)≤ℓ(G)+2c(G)\operatorname{mdim}(G)\leq \ell(G)+2c(G), where ℓ(G)\ell(G) is the number of leaves and c(G)c(G) is the cyclomatic number. Moreover, equality holds if and only if GG is either a cactus graph in which every cycle has precisely one vertex of degree at least 33, or a balanced Θ\Theta-graph.

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.