Eroh–Kang–Yi cycle-rank conjecture for metric dimension and zero forcing
Statement
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.
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.