Counterexamples and Superexponential Multiplicity for Local Graph Energy

For a finite simple graph ๐บ, let ๐ธ (๐บ) be its adjacency energy and set ๐‘’(๐บ) =ร๐‘ฃโˆˆ๐‘‰ (๐บ) [๐ธ (๐บ) โˆ’ ๐ธ (๐บ โˆ’ ๐‘ฃ)]. We give two nonisomorphic connected graphs of orderten with the same adjacency spectrum and the same multiset of vertex-deleted spectra. Theirlocal energies coincide, contradicting a conjecture and a small-order classification of Dedeand Popat. Complete joins yield such pairs at every order at least ten. We also constructnoncospectral connected graphs of order eighteen with local energy 72 and prove that thelargest equal-local-energy class ๐‘€ (๐‘›) satisfies log ๐‘€ (๐‘›) โ‰ฅ ๐‘› log ๐‘› โˆ’ 2๐‘› log log ๐‘› โˆ’ ๐‘‚ (๐‘›). Theminimum possible counterexample order is not determined.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24417520
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Counterexamples and Superexponential Multiplicity for Local Graph Energy

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

Counterexamples and Superexponential Multiplicity for Local Graph Energy

Tony Newton
preprint en

Abstract

For a finite simple graph ๐บ, let ๐ธ (๐บ) be its adjacency energy and set ๐‘’(๐บ) =ร๐‘ฃโˆˆ๐‘‰ (๐บ) [๐ธ (๐บ) โˆ’ ๐ธ (๐บ โˆ’ ๐‘ฃ)]. We give two nonisomorphic connected graphs of orderten with the same adjacency spectrum and the same multiset of vertex-deleted spectra. Theirlocal energies coincide, contradicting a conjecture and a small-order classification of Dedeand Popat. Complete joins yield such pairs at every order at least ten. We also constructnoncospectral connected graphs of order eighteen with local energy 72 and prove that thelargest equal-local-energy class ๐‘€ (๐‘›) satisfies log ๐‘€ (๐‘›) โ‰ฅ ๐‘› log ๐‘› โˆ’ 2๐‘› log log ๐‘› โˆ’ ๐‘‚ (๐‘›). Theminimum possible counterexample order is not determined.

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