Characterization of equality in the mixed metric dimension bound
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.
References
- Jelena Sedlar and Riste Škrekovski, “Extremal mixed metric dimension with respect to the cyclomatic number”, arXiv:2012.08590 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.