摘要
The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. Let B(n) be the class of bipartite bicyclic graphs on n vertices containing a cycle with length congruent to 2 modulo 4 We determine respectively the graphs with minimal energies in the class of graphs in B(n) with exactly three cycles, in the class of graphs in B(n) with exactly two cycles of a common vertex, and in the class of graphs in B(n) with exactly two vertex-disjoint cycles.
- 出版日期2008
- 单位华南师范大学