← All problems

Sum-Balaban extremal dumbbell-like graph conjecture

8 years old · documented by

Let Da,b,a′D_{a,b,a'} be a dumbbell graph, and assume a≤a′a\leq a'. A dumbbell-like graph Da,b,a′ℓD_{a,b,a'}^{\ell} is obtained from Da,b,a′D_{a,b,a'} by inserting ℓ\ell edges between v1v_1 and KaK_a when ℓ>0\ell>0, or removing −ℓ-\ell edges between vb−1v_{b-1} and Ka′′K'_{a'} when ℓ<0\ell<0.

Dumbbell-like graph conjecture. Dumbbell-like graphs Da,b,a′ℓD_{a,b,a'}^{\ell} attain the minimum value of sum-Balaban index.

The conjecture is supported by the paper's computer experiments, which examine dumbbell and dumbbell-like graphs for a range of orders. The supplied status evidence identifies it as an open problem.

References
  1. Martin Knor, Jaka Kranjc, Riste Škrekovski and Aleksandra Tepeh, “On the minimum value of sum-Balaban index”, arXiv:1701.02716 (2017).

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.