THE MINIMUM ORDER OF A CONNECTED 4-REGULAR BIPARTITE GRAPH WITH ENERGY-PRESERVING SELF-LOOPS
THE MINIMUM ORDER OF A CONNECTED 4-REGULAR BIPARTITE GRAPHWITH ENERGY-PRESERVING SELF-LOOPSTONY NEWTONAbstract. For a connected 4-regular bipartite graph 𝐺, let 𝐺𝑆 be obtained by placing one loop ateach vertex of a nonempty proper set 𝑆. Using centered adjacency energy, we establish the sharpminimum𝑛min (4) = 28.The lower bound follows from a polar-sign equality criterion, restrictions on polar-support components,and exact finite-arithmetic exclusions. The prism over the Heawood graph attains equality on 28vertices. Earlier counterexamples to strict energy increase and the prism spectral formula are treatedas prior art.
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.24425351
- Primary Topic
- Graph theory and applications
- Type
- preprint