The equality characterization for leafless vertex metric dimension
Let be a connected graph with minimum degree . A daisy graph is a graph consisting of at least two cycles sharing one vertex, and a petal is one of its cycles; denotes the corresponding theta graph with three internally disjoint paths of lengths . The leafless vertex metric dimension equality conjecture.
if and only if is a daisy graph without odd petals, , or . The source presents this as an expected characterization; it is proved only for the classes treated in the paper, so the general statement remains open.
References
- Martin Knor, Jelena Sedlar and Riste Škrekovski, “Remarks on the vertex and the edge metric dimension of 2-connected graphs”, arXiv:2203.07335 (2022).
Progress summary
Never refreshed
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.