ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G≠CnG\ne C_n be a graph, and let c(G)c(G) denote its cyclomatic number. The quantity L1(G)L_1(G) is the parameter used in the mixed metric dimension bound, and mdim(G)\mathrm{mdim}(G) denotes the mixed metric dimension of GG. Mixed metric dimension conjecture.

mdim(G)≤L1(G)+2c(G).\mathrm{mdim}(G)\leq L_1(G)+2c(G).

The bound is established in the paper for cactus graphs, including trees and unicyclic graphs, where the number of edge-disjoint cycles equals the cyclomatic number. The conjecture asks whether the same inequality holds for general graphs; the supplied source gives no resolution.

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.