Derives explicit maximum-energy conditions for all cases and minimum-energy conditions for most cases of complex unit gain dumbbell graphs D_{r,s,ℓ}, with Hessian analysis for the remaining all-odd case.
Gutman, The energy of a graph, Ber
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
New upper bounds are established for the spectral radius and low energy of the A_alpha-matrix of digraphs, with equality characterizations and numerical evidence of sharpness over existing bounds.
citing papers explorer
-
On the Extremal Energy of Complex Unit Gain Dumbbell Graphs
Derives explicit maximum-energy conditions for all cases and minimum-energy conditions for most cases of complex unit gain dumbbell graphs D_{r,s,ℓ}, with Hessian analysis for the remaining all-odd case.
-
New Bounds for the Spectral Radius and Low Energy of the $A_\alpha$-Matrix of Digraphs
New upper bounds are established for the spectral radius and low energy of the A_alpha-matrix of digraphs, with equality characterizations and numerical evidence of sharpness over existing bounds.