A clique with a five-edge tail reverses the hubs-biased Kirchhoff ordering
Abstract
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.
AI-assisted research preprint. The scoped main statement has a Lean certificate; internal AI review is not external journal peer review. Bounded prior-art searches do not certify worldwide priority. See the paper for qualifications and supplementary results not covered by Lean.
Supplementary files
Comments
Submitted by Myeongjin Kang. Original AI-assisted research draft and source proof package; draft preparation and internal campaign-status language in the PDF records its preparation stage. Related MathDB problem 349441. 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. Attachments: proof-sources.json preserves UTF-8 source files from the accepted proof archive; extract_sources.py reconstructs them. The original archive SHA-256 is recorded in the JSON.