Estrada–Mugnolo's Kirchhoff-index ordering conjecture for hubs-biased resistance distances
Let be a connected graph. Write for the Kirchhoff index based on the hubs-repelling resistance distance, for the standard Kirchhoff index, and for the Kirchhoff index based on the hubs-attracting resistance distance.
Kirchhoff-index ordering conjecture. For ,
with equality if and only if is regular.
The conjecture was formulated after computational experiments on more than 12,000 connected graphs with , and predicts that hubs-repelling navigation gives the largest Kirchhoff index while hubs-attracting navigation gives the smallest. Its general validity is left open in the source.
References
- Ernesto Estrada and Delio Mugnolo, “Hubs-biased resistance distances on graphs and networks”, arXiv:2101.07103 (2021).
Progress summary
A recent unverified submission claims the conjecture is false by giving a concrete graph where the predicted ordering reverses.
Estrada and Mugnolo proposed that hubs-repelling, standard, and hubs-attracting Kirchhoff indices satisfy , with equality exactly for regular graphs.
Known results
Estrada and Mugnolo (2021) verified the ordering computationally for more than connected graphs with ; no general proof or counterexample was reported in the published source.
November 7, 2026 community counterexample claim
A submitted proof argues that a clique with a five-edge pendant path violates the conjecture, reporting . It also claims failure under a literal Moore–Penrose interpretation. The argument and its claimed scope are unverified.
Current status (as of November 2026): The conjecture remains unsettled; a community submission claims a counterexample, but that claim has not been independently verified.
Sources
Solutions 1
A clique with a five-edge tail reverses the hubs-biased Kirchhoff orderingSee full solution
Result and scope. Estrada-Mugnolo (J. Math. Anal. Appl. 507 (2022) 125728, arXiv:2101.07103) Conjecture 4.13 asserts R_1 >= R_0 >= R_-1 for hubs-biased Kirchhoff indices, with equality iff regular. The spectral index the authors computed (Lemma 4.6, n*tr of the group inverse) satisfies the ordering for all 12,103 connected graphs with 5<=n<=8 (independent review), but K6 with a pendant five-edge path has R_1 = 1696684/14035 < 370/3 = R_0. The literal Moore-Penrose reading (4.3) also fails there (515538204/7137235) and already fails at n=5, an uncredited source inconsistency.
Complete proof: A clique with a five-edge tail reverses the hubs-biased Kirchhoff ordering · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.