Resumen de Ordering of minimal energies in unicyclic signed graphs

Tahir Shamsher, Mushtaq A. Bhat, Shariefuddin Pirzada, Yilun Shang

• Let S = (G, σ) be a signed graph of order n and size m and let t P1, t2, . . . , tn be the eigenvalues of S. The energy of S is defined as E(S) =nj=1 |tj |. A connected signed graph is said to be unicyclic if its order and size are the same. In this paper we characterize, up to switching, the unicyclic signed graphs with first 11 minimal energies for all n ≥ 11. For 3 ≤ n ≤ 7, we provide complete orderings of unicyclic signed graphs with respect to energy. For 8 ≤ n ≤ 10, we determine unicyclic signed graphs with first 13 minimal energies.