pith. sign in

arxiv: 2604.27785 · v1 · submitted 2026-04-30 · 🧮 math.CO

On the Extremal Energy of Complex Unit Gain Dumbbell Graphs

Silin Huang This is my paper

Pith reviewed 2026-05-07 06:28 UTC · model grok-4.3

classification 🧮 math.CO
keywords complex unit gain graphdumbbell graphgraph energycharacteristic polynomialmatching polynomialextremal energybipartitenon-bipartite
0
0 comments X

The pith

The characteristic polynomial of complex unit gain dumbbell graphs is expressed using matching polynomials of subgraphs, solving extremal energy problems except one case.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes an explicit expression for the characteristic polynomial of a complex unit gain graph on the dumbbell graph D_{r,s,ℓ} by relating it to the matching polynomials of selected subgraphs. This formula supports two methods for locating maximum and minimum energy: coefficient comparison when the underlying graph is bipartite and analysis of integral kernels in an analog of Coulson's formula when it is not. These techniques resolve the extremal energy questions for all parity combinations of r, s, and ℓ except the minimum energy case when all three parameters are odd. The paper supplies numerical counterexamples for the remaining case and identifies it as open.

Core claim

An explicit expression of the characteristic polynomial of the complex unit gain dumbbell graph D_{r,s,ℓ} is derived in terms of the matching polynomials of some of its subgraphs. This is used to build two methods to solve the extremal energy problem in different parity cases: coefficient comparison for the bipartite case and direct analysis of the integral kernels in an analog of Coulson's formula for the non-bipartite case. The problems are solved for all parity cases except for the minimum energy problem when r, s are odd and ℓ is odd.

What carries the argument

The explicit expression of the characteristic polynomial in terms of matching polynomials of subgraphs, which reduces the extremal energy search to coefficient comparisons or kernel analysis.

Load-bearing premise

The coefficient-comparison and integral-kernel methods suffice to locate the extrema once the characteristic polynomial is known, except in the all-odd minimum-energy case where the ordering of energies is not settled by the same analysis.

What would settle it

A full enumeration of all distinct complex unit gain assignments on D_{r,s,ℓ} for small odd values such as r=s=ℓ=3, with direct computation of their energies to check whether any assignment yields a lower energy than the candidates considered in the numerical experiments.

read the original abstract

We study the extremal energy problem for complex unit gain graphs whose underlying graph is the dumbbell graph $D_{r,s,\ell}$. An explicit expression of its characteristic polynomial is derived in terms of the matching polynomials of some of its subgraphs. This is used to build two methods to solve the problem in different parity cases. For the bipartite case, we establish a method by performing coefficient comparison. For the non-bipartite case, we directly analyze the integral kernels in an analog of Coulson's formula. The problems are solved for all parity cases except for the minimum energy problem when $r,s$ are odd and $\ell$ is odd. We present several counterexamples obtained from numerical experiments and leave this as an open problem.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper studies the extremal energy problem for complex unit gain graphs whose underlying graph is the dumbbell graph D_{r,s,ℓ}. It derives an explicit expression for the characteristic polynomial in terms of the matching polynomials of some of its subgraphs. This expression is used to construct two methods for solving the extremal problems in different parity cases: coefficient comparison in the bipartite case and direct analysis of the integral kernels in an analog of Coulson's formula in the non-bipartite case. The problems are solved for all parity combinations except the minimum-energy problem when r, s, and ℓ are all odd; several numerical counterexamples are supplied for this remaining case, which is left open.

Significance. If the derivations hold, the manuscript advances the extremal energy theory for complex unit gain graphs by furnishing an explicit characteristic polynomial via matching polynomials and by resolving the extremal values analytically for nearly all parity configurations of the dumbbell parameters. The combination of coefficient comparison and integral-kernel analysis supplies concrete, falsifiable results in the resolved cases, while the explicit flagging of the all-odd minimum-energy case together with numerical counterexamples delineates the boundary of the current analysis. These features make the work a useful reference for subsequent studies on gain graphs with similar block structures.

minor comments (3)
  1. [Introduction] The introduction should include a concise definition or diagram of the dumbbell graph D_{r,s,ℓ} (with r, s, ℓ denoting the lengths of the two paths and the cycle, respectively) to orient readers unfamiliar with the notation.
  2. [Characteristic polynomial] In the section deriving the characteristic polynomial, state explicitly which subgraphs appear and how their matching polynomials combine; a short table summarizing the polynomial for each parity class would improve readability.
  3. [Numerical experiments] The numerical counterexamples for the open all-odd minimum-energy case would be clearer if presented in a compact table listing the gain values, computed energies, and the conjectured ordering.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and for the positive assessment, including the recommendation to accept. The referee's summary accurately captures both the explicit characteristic polynomial derivation via matching polynomials and the resolution of the extremal energy problems in all parity cases except the remaining open minimum-energy case when r, s, and ℓ are all odd.

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The central derivation begins with an explicit characteristic polynomial expressed via matching polynomials of subgraphs, which rests on standard, externally verifiable identities in graph theory rather than any self-referential definition or fit. This polynomial is then applied through coefficient comparison (bipartite case) and direct analysis of integral kernels in an established analog of Coulson's formula (non-bipartite case). Neither technique reduces the extremal energy values to a parameter fitted from the target result itself, nor does any load-bearing step rely on a self-citation chain that presupposes the final claim. The single unresolved case (minimum energy when r, s, ℓ all odd) is explicitly flagged as open after numerical checks, confirming the derivation does not force a conclusion by construction. The overall chain is self-contained against independent mathematical benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard results from algebraic graph theory: the characteristic polynomial of a gain graph can be expressed via matching polynomials of subgraphs, and an integral representation analogous to Coulson's formula applies to the energy. No free parameters are fitted to data and no new entities are postulated.

axioms (2)
  • standard math Characteristic polynomial of a complex unit gain graph on a dumbbell can be written explicitly using matching polynomials of selected subgraphs
    Invoked to obtain the explicit expression used in both solution methods.
  • domain assumption An analog of Coulson's integral formula holds for the energy of non-bipartite complex unit gain graphs
    Used to analyze the non-bipartite case via integral kernels.

pith-pipeline@v0.9.0 · 5411 in / 1583 out tokens · 59984 ms · 2026-05-07T06:28:38.698856+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

20 extracted references · 14 canonical work pages

  1. [1]

    Harary, On the notion of balance of a signed graph., Michigan Mathematical Journal 2 (2) (1953) 143–146

    F. Harary, On the notion of balance of a signed graph., Michigan Mathematical Journal 2 (2) (1953) 143–146. doi:10.1307/mmj/1028989917

    work page doi:10.1307/mmj/1028989917 1953

  2. [2]

    Zaslavsky, Biased graphs

    T. Zaslavsky, Biased graphs. I. Bias, balance, and gains, Journal of Combinatorial Theory, Series B 47 (1) (1989) 32–52. doi:10.1016/0095-8956(89)90063-4

    work page doi:10.1016/0095-8956(89)90063-4 1989

  3. [3]

    Samanta, M

    A. Samanta, M. Rajesh Kannan, Bounds and extremal graphs for the energy of complex unit gain graphs, Linear Algebra and its Applications 721 (2025) 844–866. doi:10.1016/ j.laa.2024.03.028

    2025

  4. [4]

    Reff, Spectral properties of complex unit gain graphs, Linear Algebra and its Applica- tions 436 (9) (2012) 3165–3176

    N. Reff, Spectral properties of complex unit gain graphs, Linear Algebra and its Applica- tions 436 (9) (2012) 3165–3176. doi:10.1016/j.laa.2011.10.021

    work page doi:10.1016/j.laa.2011.10.021 2012

  5. [5]

    Mehatari, M

    R. Mehatari, M. R. Kannan, A. Samanta, On the adjacency matrix of a complex unit gain graph, Linear and Multilinear Algebra 70 (9) (2022) 1798–1813. doi:10.1080/03081087. 2020.1776672

    work page doi:10.1080/03081087 2022

  6. [6]

    Gutman, The energy of a graph, Ber

    I. Gutman, The energy of a graph, Ber. Math.-Stat. Sekt. Forschungszent. Graz 103, 22 S. (1978)

    1978

  7. [7]

    Belardo, M

    F. Belardo, M. Brunetti, S. Khan, NEPS of complex unit gain graphs, The Electronic Journal of Linear Algebra 39 (2023) 621–643. doi:10.13001/ela.2023.8015

    work page doi:10.13001/ela.2023.8015 2023

  8. [8]

    M. A. Bhat, S. Pirzada, Unicyclic signed graphs with minimal energy, Discrete Applied Mathematics 226 (2017) 32–39. doi:10.1016/j.dam.2017.03.015

    work page doi:10.1016/j.dam.2017.03.015 2017

  9. [9]

    M. A. Bhat, U. Samee, S. Pirzada, Bicyclic signed graphs with minimal and second minimal energy, Linear Algebra and its Applications 551 (2018) 18–35. doi:10.1016/j.laa.2018. 03.047. 17

    work page doi:10.1016/j.laa.2018 2018

  10. [10]

    Y. Wang, Y. Gao, Research on extreme signed graphs with minimal energy in tricyclic signed graphs S(n, n + 2), Complexity 2020 (2020) 1–8. doi:10.1155/2020/8747684

    work page doi:10.1155/2020/8747684 2020

  11. [11]

    Samanta, M

    A. Samanta, M. R. Kannan, Bounds for the energy of a complex unit gain graph, Linear Algebra and its Applications 612 (2021) 1–29. doi:10.1016/j.laa.2020.11.019

    work page doi:10.1016/j.laa.2020.11.019 2021

  12. [12]

    Furtula, S

    B. Furtula, S. Radenkovic, I. Gutman, Bicyclic molecular graphs with the greatest en- ergy, Journal of the Serbian Chemical Society 73 (4) (2008) 431–433. doi:10.2298/ JSC0804431F

    2008

  13. [13]

    Reff, Oriented gain graphs, line graphs and eigenvalues, Linear Algebra and its Appli- cations 506 (2016) 316–328

    N. Reff, Oriented gain graphs, line graphs and eigenvalues, Linear Algebra and its Appli- cations 506 (2016) 316–328. doi:10.1016/j.laa.2016.05.040

    work page doi:10.1016/j.laa.2016.05.040 2016

  14. [14]

    J. Wang, F. Belardo, Q. Huang, E. M. L. Marzi, Spectral characterizations of dumbbell graphs, The Electronic Journal of Combinatorics 17 (1) (2010) R42. doi:10.37236/314

    work page doi:10.37236/314 2010

  15. [15]

    Mateljevi´ c, V

    M. Mateljevi´ c, V. Boˇ zin, I. Gutman, Energy of a polynomial and the Coulson integral formula, Journal of Mathematical Chemistry 48 (4) (2010) 1062–1068. doi:10.1007/ s10910-010-9725-z

    2010

  16. [16]

    Samanta, M

    A. Samanta, M. R. Kannan, On the spectrum of complex unit gain graph, Journal of the Ramanujan Mathematical Society 39 (2) (2024) 131–142. doi:10.48550/arXiv.1908. 10668

    work page doi:10.48550/arxiv.1908 2024

  17. [17]

    Wissing, E

    P. Wissing, E. R. Van Dam, Symmetry in complex unit gain graphs and their spectra, Linear Algebra and its Applications 722 (2025) 164–177. doi:10.1016/j.laa.2025.05. 012

    work page doi:10.1016/j.laa.2025.05 2025

  18. [18]

    Gutman, The matching polynomial, MATCH Communications in Mathematical and in Computer Chemistry 6 (1979) 75–91

    I. Gutman, The matching polynomial, MATCH Communications in Mathematical and in Computer Chemistry 6 (1979) 75–91

    1979

  19. [19]

    Gutman, Some relations for the µ-polynomial, MATCH Communications in Mathemat- ical Chemistry 19 (1986) 127–137

    I. Gutman, Some relations for the µ-polynomial, MATCH Communications in Mathemat- ical Chemistry 19 (1986) 127–137

    1986

  20. [20]

    Cigler, q-Fibonacci polynomials, The Fibonacci Quarterly 41 (1) (2003) 31–40

    J. Cigler, q-Fibonacci polynomials, The Fibonacci Quarterly 41 (1) (2003) 31–40. doi: 10.1080/00150517.2003.12428602. 18

    work page doi:10.1080/00150517.2003.12428602 2003