Eroh–Kang–Yi cycle-rank conjecture for metric dimension and zero forcing
Let be a connected graph. Write for its zero forcing number, let denote its metric dimension, and let be the number of edges that must be removed from to obtain a forest. Cycle-rank conjecture.
This conjecture compares two graph parameters and is known for trees and graphs with one cycle. The paper proves a weaker bound, so the conjecture remains open in the stated generality.
References
- Nicolas Bousquet, Quentin Deschamps, Aline Parreau and Ignacio M. Pelayo, “Metric dimension on sparse graphs and its applications to zero forcing sets”, arXiv:2111.07845 (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.