ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph that is not a cycle. Write O(G)=V(G)∪E(G)O(G)=V(G)\cup E(G), let dimm⁡(G)\operatorname{dim_m}(G) denote the minimum cardinality of a mixed metric generator of GG, let ℓ(G)\ell(G) be the number of leaves of GG, and let

c(G)=∣E(G)∣−∣V(G)∣+1c(G)=|E(G)|-|V(G)|+1

be its cyclomatic number. Sedlar–Škrekovski's conjecture.

dimm⁡(G)≤ℓ(G)+2c(G).\operatorname{dim_m}(G)\leq \ell(G)+2c(G).

Sedlar and Škrekovski proposed this bound after determining the mixed metric dimension of unicyclic graphs. The conjecture concerns the mixed metric dimension of connected graphs beyond cycles; its resolution is not established in the supplied source.

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.