Aouchiche's Randić index–diameter bounds conjecture

From papers

Let GG be a graph with nn vertices. Write R=R(G)R=R(G) for its Randić index and dd for its diameter. Aouchiche's conjecture. The two bounds

Rd2n+12,R-d\geq \sqrt 2-\frac{n+1}{2},

and

Rdn3+222n2\frac{R}{d}\geq \frac{n-3+2\sqrt 2}{2n-2}

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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Margaret I. Doig, “Randic index, radius, and diameter for cactus graphs”, arXiv:2107.00071 (2021).

Solutions 0

No solutions have been posted yet.