RT - Journal Article
T1 - MORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES
JF - IJMSI
YR - 2007
JO - IJMSI
VO - 2
IS - 2
UR - http://ijmsi.ir/article-1-77-en.html
SP - 57
EP - 62
K1 - Energy of graph
K1 - Spectral graph theory
K1 - Biregular graphs
K1 - Triregular graphs.
AB - 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
LA eng
UL http://ijmsi.ir/article-1-77-en.html
M3 10.7508/ijmsi.2007.02.007
ER -