ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G≠K2G\ne K_{2} be a graph with cyclomatic number cc, defined by c=∣E(G)∣−∣V(G)∣+1c=|E(G)|-|V(G)|+1. Here, dim⁡(G)\dim(G) and edim⁡(G)\operatorname{edim}(G) denote the vertex and edge metric dimensions of GG, respectively.

Cyclomatic-number bound. For every such graph,

∣dim⁡(G)−edim⁡(G)∣≤c.\left\vert \dim(G)-\operatorname{edim}(G)\right\vert \leq c.

The bound is motivated by the corresponding equality for trees other than K2K_{2} and by the established result for unicyclic graphs. The claim proposes the analogous bound for graphs with higher cyclomatic number; the paper presents it as an ongoing conjectural direction.

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.