The Minimum Order of a Connected 4-regular Bipartite Graph With Energy-preserving Self-loops
Year: 2026
Type: preprint
Abstract: 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.
Author: Newton, Tony
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7237346992
Cites:
Cited by:
Related to:
