On the Extremal Energy of Complex Unit Gain Dumbbell Graphs

TL;DR

This paper investigates the extremal energy of complex unit gain dumbbell graphs, deriving explicit formulas and methods for different cases, and identifies unresolved cases with counterexamples.

Contribution

It introduces two methods for solving the extremal energy problem in different parity cases and derives explicit characteristic polynomial expressions.

Findings

Explicit characteristic polynomial expressions for dumbbell graphs.

Two methods for extremal energy analysis based on graph parity.

Identification of unresolved cases with counterexamples.

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.