Unicyclic graphs with maximal energy
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Related Research Unit(s)
|Journal / Publication||Linear Algebra and Its Applications|
|Publication status||Published - 15 Nov 2002|
|Link to Scopus||https://www.scopus.com/record/display.uri?eid=2-s2.0-84969223228&origin=recordpage|
Let G be a graph on n vertices and let λ"1,λ"2,.,λ(n) be its eigenvalues. The energy of G is defined as E(G)=|λ"1|+|λ"2|+⋯+|λ(n)|. For various classes of unicyclic graphs, the graphs with maximal energy are determined. Let P(n)^6 be obtained by connecting a vertex of the circuit C"6 with a terminal vertex of the path P(n-6). For n≥7, P(n)^6 has the maximal energy among all connected unicyclic bipartite n-vertex graphs, except the circuit C(n).
- Bipartite graph, Energy of graph, Spectra of graph, Unicyclic graph