Exact Global Extremality of the Additive Degree–Kirchhoff Index: Density Concentration, Electrical Rigidity, and the Palacios Barbell Problem

For a connected graph, the additive degree–Kirchhoff index weights effective resistanceby the degrees of its endpoints. Palacios proposed asymptotically balanced clique–path barbells asextremal candidates. We give an exact resistance formula, exhibit an infinite family in which the exactlyequal-size prescription fails at finite order, and prove eventual uniqueness of the optimum within thebarbell class. We also derive an explicit high-degree neighbourhood bound for arbitrary connected graphsand a density-merging inequality that forces two equal macroscopic regions in the limiting optimizationproblem. These results do not establish that every sufficiently large global maximizer is a barbell. Weidentify the quantitative path-stretching and stability steps that require additional certification. Exactrational Laplacian calculations and exhaustive barbell comparisons through order 200 are supplied forindependent reproduction.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24407496
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Exact Global Extremality of the Additive Degree–Kirchhoff Index: Density Concentration, Electrical Rigidity, and the Palacios Barbell Problem

Tony Newton
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

Exact Global Extremality of the Additive Degree–Kirchhoff Index: Density Concentration, Electrical Rigidity, and the Palacios Barbell Problem

Tony Newton
preprint en

Abstract

For a connected graph, the additive degree–Kirchhoff index weights effective resistanceby the degrees of its endpoints. Palacios proposed asymptotically balanced clique–path barbells asextremal candidates. We give an exact resistance formula, exhibit an infinite family in which the exactlyequal-size prescription fails at finite order, and prove eventual uniqueness of the optimum within thebarbell class. We also derive an explicit high-degree neighbourhood bound for arbitrary connected graphsand a density-merging inequality that forces two equal macroscopic regions in the limiting optimizationproblem. These results do not establish that every sufficiently large global maximizer is a barbell. Weidentify the quantitative path-stretching and stability steps that require additional certification. Exactrational Laplacian calculations and exhaustive barbell comparisons through order 200 are supplied forindependent reproduction.

Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Exact Global Extremality of the Additive Degree–Kirchhoff Index: Density Concentration, Electrical Rigidity, and the Palacios Barbell Problem — Tony Newton · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS