On ordering of minimal energies in bicyclic signed graphs
On ordering of minimal energies in bicyclic signed graphs
Abstract Let S = (G, σ) be a signed graph of order n and size m and let x 1 , x 2 , ..., x n be the eigenvalues of S. The energy of S is defined as <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="inline"> <m:mrow> <m:mi>ɛ</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mi>S</m:mi> <m:mo>)</m:mo> </m:mrow> <m:mo>=</m:mo> …