← All problems

Wiener–Randić distance conjecture for trees

11 years old · traced to

Let TT and T′T' be any two trees with nn vertices. Wiener–Randić distance conjecture. It holds

dW(T,T′)≥dR(T,T′).d_W(T,T')\geq d_R(T,T').

The conjecture compares graph distance measures induced by the Wiener and Randić indices.

References

Status

  • Refuted: Aleksandar Ilić and Milovan Ilić. Counterexamples to conjectures on graph distance measures based on topological indexes (Applied Mathematics and Computation, 2017) https://doi.org/10.1016/j.amc.2016.10.024

Source: Aleksandar Ilic and Milovan Ilic, “Counterexamples to conjectures on graph distance measures based on topological indexes”, arXiv:1512.08149 (2016).

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.