← All problems

Nadjafi-Arani et al.'s Szeged–Wiener inequality for non-complete blocks

10 years old · traced to

Let GG be a connected graph and let B1,…,BkB_1,\ldots,B_k be all its non-complete blocks, of respective orders n1,…,nkn_1,\ldots,n_k. Define the Szeged–Wiener difference by η(G)=Sz⁡(G)−W(G)\eta(G)=\operatorname{Sz}(G)-W(G). Nadjafi-Arani et al.'s conjecture. One has

η(G)≥∑i=1k(2ni−6).\eta(G)\ge \sum_{i=1}^k(2n_i-6).

The paper proves this conjecture as a consequence of its theorem for 22-connected non-complete graphs, so the proposed inequality is solved.

References

Status

  • Solved: Marthe Bonamy, Martin Knor, Borut Lužar, Alexandre Pinlou, and Riste Škrekovski. On the difference between the Szeged and Wiener index (Applied Mathematics and Computation, 2017) https://arxiv.org/abs/1602.05184

Source: Marthe Bonamy, Martin Knor, Borut Lužar, Alexandre Pinlou and Riste Škrekovski, “On the difference between the Szeged and Wiener index”, arXiv:1602.05184 (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.