Skip to main navigation Skip to search Skip to main content

Unicyclic graphs with maximal energy

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

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).
Original languageEnglish
Pages (from-to)27-36
JournalLinear Algebra and Its Applications
Volume356
Issue number1-3
DOIs
Publication statusPublished - 15 Nov 2002

Research Keywords

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

Fingerprint

Dive into the research topics of 'Unicyclic graphs with maximal energy'. Together they form a unique fingerprint.

Cite this