ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let c(G)c(G) be its cyclomatic number, let L1(G)L_1(G) be its number of leaves, and let mdim(G)\mathrm{mdim}(G) be its mixed metric dimension. A cactus graph is a graph in which all cycles are pairwise edge disjoint; a balanced Theta graph is the class of Theta graphs defined as balanced in the paper. Equality characterization conjecture.

mdim(G)=L1(G)+2c(G)\mathrm{mdim}(G)=L_1(G)+2c(G)

if and only if GG is a cactus graph in which every cycle has precisely one vertex of degree at least 33, or GG is a balanced Theta graph. This conjecture refines the general upper-bound conjecture by characterizing exactly when equality occurs; the paper establishes the claimed equality for the listed families but leaves the converse classification open.

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.