Choice Number and Energy of Graphs

Simple item page
dc.creatorAkbari, Saieed
dc.creatorGhorbani, Ebrahim
dc.date2007-12-06
dc.date.accessioned2026-07-07T08:47:39Z
dc.date.available2026-07-07T08:47:39Z
dc.descriptionThe energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. It is proved that E(G)>= 2(n-χ(\bar{G}))>= 2(ch(G)-1) for every graph G of order n, and that E(G)>= 2ch(G) for all graphs G except for those in a few specified families, where \bar{G}, χ(G), and ch(G) are the complement, the chromatic number, and the choice number of G, respectively.
dc.descriptionto appear in Linear Algebra and its Applications
dc.identifierhttps://arxiv.org/abs/0712.0920
dc.identifierhttp://arxiv.org/abs/0712.0920
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143674
dc.subjectCombinatorics
dc.subject05C15, 05C50, 15A03
dc.titleChoice Number and Energy of Graphs
dc.typetext

Files

Collections

arXiv