All-minimizer asymptotic balance for the sum-Balaban index of dumbbells

Myeongjin Kang

Abstract

For every eventually minimizing choice of actual sum-Balaban-index dumbbells D(a,b,d), with positive integers a,b,d, a+b+d=n, a<=d, two disjoint cliques and a disjoint b-VERTEX path with EVERY clique vertex attached to its respective path endpoint, a/sqrt(n) and d/sqrt(n) tend to c=sqrt(sqrt(Q)), Q=sqrt(2)*log(1+sqrt(2)), and b/n tends to1. Includes actual graph distance/transmissions, real edge objective, all admissible competitors, attainment and all-minimizer uniformity. Not exact finite balance, not global minimum over all connected graphs.

AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.

1

Supplementary files

  • proof-sources.json705.3 KBOpen
  • extract_sources.py601 BOpen

Comments

Related problem 335033. Proof sources supplied as gzip+base64 proof-sources.json, extract_sources.py, and supporting.zip. No worldwide-priority certification.

Version history

Discussion 0