Gutman–Furtula revised conjecture on trees with minimal ABC index

At least 12 years old · documented by

Let GG be a tree with minimal atom-bond connectivity (ABC) index among all trees of size nn. The trees T0,T1,T2,T3,T4,T5,T6T_0,T_1,T_2,T_3,T_4,T_5,T_6 are the structures depicted in Figure~. Gutman–Furtula's revised conjecture. If nn satisfies one of the following congruence conditions, then GG has the corresponding structure:

n≡0(mod7), n≥175⟹G has structure T0,n≡1(mod7), n≥64⟹G has structure T1,n≡2(mod7), n≥1185⟹G has structure T2,n≡3(mod7), n≥80⟹G has structure T3,n≡4(mod7), n≥312⟹G has structure T4,n≡5(mod7), n≥117⟹G has structure T5,n≡6(mod7), n≥62⟹G has structure T6.\begin{array}{ll} n \equiv 0 \pmod{7},\ n \geq 175 &\Longrightarrow G\text{ has structure }T_0,\\ n \equiv 1 \pmod{7},\ n \geq 64 &\Longrightarrow G\text{ has structure }T_1,\\ n \equiv 2 \pmod{7},\ n \geq 1185 &\Longrightarrow G\text{ has structure }T_2,\\ n \equiv 3 \pmod{7},\ n \geq 80 &\Longrightarrow G\text{ has structure }T_3,\\ n \equiv 4 \pmod{7},\ n \geq 312 &\Longrightarrow G\text{ has structure }T_4,\\ n \equiv 5 \pmod{7},\ n \geq 117 &\Longrightarrow G\text{ has structure }T_5,\\ n \equiv 6 \pmod{7},\ n \geq 62 &\Longrightarrow G\text{ has structure }T_6. \end{array}

This is a revised version of the conjecture of Gutman and Furtula after counterexamples to earlier formulations based on a central-vertex structure. The paper reports computational evidence and notes that determining the extent of the violation of the earlier conjectures remains open.

References

Primary source

Darko Dimitrov, “Efficient computation of trees with minimal atom-bond connectivity index”, arXiv:1305.1155 (2013).

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.