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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

THE MINIMUM ORDER OF A CONNECTED 4-REGULAR BIPARTITE GRAPH WITH ENERGY-PRESERVING SELF-LOOPS

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

THE MINIMUM ORDER OF A CONNECTED 4-REGULAR BIPARTITE GRAPH WITH ENERGY-PRESERVING SELF-LOOPS

Tony Newton
preprint en

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.

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