Sharp Bicyclic Minima of the Variable EulerβSombor Index for Negative Parameters
For a connected simple bicyclic graph πΊ on π β₯ 4 vertices, let EUπ (πΊ) = Γπ’π£βπΈ (πΊ) (π2π’ +π2π£ + πππ’ ππ£ )1/2. We prove that, for every β2 < π < 0,minπΊ EUπ (πΊ) = 4β13 + 6π + (2π β 5)β2 + π.Equality holds exactly for two adjacent degree-three vertices and all other degrees two, namely thebook and dumbbell families. The proof applies in fact to β2 < π < 2 and gives explicit stabilitybounds. At π = β2 the minimum is 4 with additional equality graphs; at π = 2 every bicyclicgraph of degree sequence (3, 3, 2, . . . , 2) minimizes. We count the nonisomorphic minimizersand include an exact finite-arithmetic regression.
Authors
- Tony Newton (ORCID: https://orcid.org/0009-0009-9189-6431)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24429392
- Primary Topic
- Graph theory and applications
- Type
- preprint