The cycle rank conjecture for metric dimension and zero forcing number

From papers

Let GG be a graph. Write dim(G)\dim(G) for its metric dimension, Z(G)Z(G) for its zero forcing number, and r(G)r(G) for its cycle rank. Cycle Rank Conjecture.

dim(G)Z(G)+r(G).\dim(G)\leq Z(G)+r(G).

The conjecture proposes that the difference between metric dimension and zero forcing number is bounded by the cycle rank. The paper gives examples showing that the analogous bound using the even cycle rank is false, while this cycle-rank bound is presented as an open conjecture.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Linda Eroh, Cong X. Kang and Eunjeong Yi, “A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs”, arXiv:1408.5943 (2017).

Solutions 0

No solutions have been posted yet.