Unicyclic graphs with maximal energy

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

66 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)27-36
Journal / PublicationLinear Algebra and Its Applications
Volume356
Issue number1-3
Publication statusPublished - 15 Nov 2002

Abstract

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).

Research Area(s)

  • Bipartite graph, Energy of graph, Spectra of graph, Unicyclic graph

Citation Format(s)

Unicyclic graphs with maximal energy. / Hou, Yaoping; Gutman, Ivan; Woo, Ching-Wah.

In: Linear Algebra and Its Applications, Vol. 356, No. 1-3, 15.11.2002, p. 27-36.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review