TY - JOUR T1 - MORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES TT - JF - IJMSI JO - IJMSI VL - 2 IS - 2 UR - http://ijmsi.ir/article-1-77-en.html Y1 - 2007 SP - 57 EP - 62 KW - Energy of graph KW - Spectral graph theory KW - Biregular graphs KW - Triregular graphs. N2 - The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G. Several classes of graphs are known that satisfy the condition E(G) > n , where n is the number of vertices. We now show that the same property holds for (i) biregular graphs of degree a b , with q quadrangles, if q M3 10.7508/ijmsi.2007.02.007 ER -