Aouchiche's Randić index–diameter bounds conjecture
Let be a graph with vertices. Write for its Randić index and for its diameter. Aouchiche's conjecture. The two bounds
and
should hold. These inequalities connect the Randić index with graph diameter. The supplied text subsequently reports that both bounds were verified for all graphs, so the conjecture is resolved.
References
Primary source
Margaret I. Doig, “Randic index, radius, and diameter for cactus graphs”, arXiv:2107.00071 (2021).
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.