Characterization of equality in the mixed metric dimension bound
Statement
Let be a graph, let be its cyclomatic number, let be its number of leaves, and let 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.
if and only if is a cactus graph in which every cycle has precisely one vertex of degree at least , or 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.