The cyclomatic-number bound for the difference between metric dimensions
Statement
Let be a graph with cyclomatic number , defined by . Here, and denote the vertex and edge metric dimensions of , respectively.
Cyclomatic-number bound. For every such graph,
The bound is motivated by the corresponding equality for trees other than 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.