Maximum Energy of Integral Circulant Graphs with Same-Parity Exponents
Abstract
The energy of a finite graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Let n be p to the power a times q to the power b, where p and q are distinct primes at least five and a and b, both positive integers, have the same parity. Among all nonempty sets D of proper divisors of n, the energy of the corresponding integral circulant graph is maximised by exactly two divisor sets: the divisors p to the power i times q to the power j with i plus j odd, and the divisors with i plus j even after removing p to the power a times q to the power b. We also determine the exact maximum energy. For the proof, weighted prime-power Ramanujan transforms yield an exact tensor-product representation of the graph energy, reducing the extremal problem to a weighted cut separating two prescribed vertices. After a sign conjugation, the relevant transforms decompose into embedded path blocks; the nontrivial blocks correspond to a weighted path together with chords of length three of weight negative one. We prove a sharp lower bound for cuts separating the two prescribed vertices in Kronecker products of these path blocks. For products of two such nontrivial blocks, equality holds only for cuts that isolate one of the two prescribed vertices. Combined with the energy-to-cut correspondence, these equality cases yield exactly the two maximising divisor sets.
Related
- Energy Maximisation for Integral Circulant Graphs with Opposite-Parity Exponents
- So's Conjecture for Integral Circulant Graphs of Order p^aq
- A proof of the maximum Laplacian energy conjecture for connected graphs via a sharp eigenvalue-sum bound
- A study on Type-2 isomorphic circulant graphs. Part 3: 384 pairs of Type-2 isomorphic circulant graphs C32(R)
- Integral homology lattices of matching and circulant complexes
BibTeX
@misc{jiang2026maximum,
title = {{Maximum Energy of Integral Circulant Graphs with Same-Parity Exponents}},
author = {Jianwei Jiang and Chunhua Yang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.36883},
eprint = {2610.36883},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.36883},
}
RIS
TY - UNPB
TI - Maximum Energy of Integral Circulant Graphs with Same-Parity Exponents
AU - Jianwei Jiang
AU - Chunhua Yang
PY - 2026
DA - 2026/10/27
PB - arXiv
DO - 10.48550/arxiv.2610.36883
UR - https://arxiv.org/abs/2610.36883
AB - The energy of a finite graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Let n be p to the power a times q to the power b, where p and q are distinct primes at least five and a and b, both positive integers, have the same parity. Among all nonempty sets D of proper divisors of n, the energy of the corresponding integral circulant graph is maximised by exactly two divisor sets: the divisors p to the power i times q to the power j with i plus j odd, and the divisors with i plus j even after removing p to the power a times q to the power b. We also determine the exact maximum energy. For the proof, weighted prime-power Ramanujan transforms yield an exact tensor-product representation of the graph energy, reducing the extremal problem to a weighted cut separating two prescribed vertices. After a sign conjugation, the relevant transforms decompose into embedded path blocks; the nontrivial blocks correspond to a weighted path together with chords of length three of weight negative one. We prove a sharp lower bound for cuts separating the two prescribed vertices in Kronecker products of these path blocks. For products of two such nontrivial blocks, equality holds only for cuts that isolate one of the two prescribed vertices. Combined with the energy-to-cut correspondence, these equality cases yield exactly the two maximising divisor sets.
ER -