{
  "id": "0712.0920",
  "version": "v1",
  "published": "2007-12-06T12:00:20.000Z",
  "updated": "2007-12-06T12:00:20.000Z",
  "title": "Choice Number and Energy of Graphs",
  "authors": [
    "Saieed Akbari",
    "Ebrahim Ghorbani"
  ],
  "comment": "to appear in Linear Algebra and its Applications",
  "categories": [
    "math.CO"
  ],
  "abstract": "The 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-\\chi(\\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}, \\chi(G), and ch(G) are the complement, the chromatic number, and the choice number of G, respectively.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2007-12-06T12:00:20.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "05C50",
      "15A03"
    ],
    "keywords": [
      "choice number",
      "chromatic number",
      "absolute values",
      "specified families"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007arXiv0712.0920A"
    }
  }
}