← All problems

Eroh–Kang–Yi cycle-rank conjecture for metric dimension and zero forcing

5 years old · traced to

Let GG be a connected graph. Write Z(G)Z(G) for its zero forcing number, let dim⁡(G)\dim(G) denote its metric dimension, and let c(G)c(G) be the number of edges that must be removed from GG to obtain a forest. Cycle-rank conjecture.

dim⁡(G)≤Z(G)+c(G).\dim(G) \leq Z(G)+c(G).

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
  1. 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.