Let λ1,λ2,…,λn be the eigenvalues of a graph G of order n. The energy of G is defined as E(G)=|λ1|+|λ2|+⋯+|λn|. Let Pn6,6 be the graph obtained from two copies of C6 joined by a path Pn-10, Bn be the class of all bipartite bicyclic graphs that are not the graph obtained from two cycles Ca and Cb (a,b⩾10 and a≡b≡2 (mod 4)) joined by an edge. In this paper, we show that Pn6,6 is the graph with maximal...
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.