← All problems

Energy–graph-entropy distance conjecture for trees

11 years old · traced to

Let TT and T′T' be any two trees with nn vertices. Energy–graph-entropy distance conjecture. It holds

dE(T,T′)≥dIg(T,T′).d_E(T,T')\geq d_{Ig}(T,T').

Here EE is the graph energy and IgIg is the entropy based on the absolute adjacency-matrix eigenvalues.

References

Status

  • Refuted: Aleksandar Ilic and Milovan Ilic. 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.