Loading...

Choice number and energy of graphs

Akbari, S ; Sharif University of Technology | 2008

28 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.laa.2007.11.028
  3. Publisher: 2008
  4. Abstract:
  5. The energy of a graph G, denoted by E (G), is defined as the sum of the absolute values of all eigenvalues of the adjacency matrix of G. It is proved that E (G) ≥ 2 (n - χ (over(G, -))) ≥ 2 (ch (G) - 1) for every graph G of order n, and that E (G) ≥ 2 ch (G) for all graphs G except for those in a few specified families, where over(G, -), χ (G), and ch (G) are the complement, the chromatic number, and the choice number of G, respectively. © 2007 Elsevier Inc. All rights reserved
  6. Keywords:
  7. Matrix algebra ; Absolute values ; Adjacency matrices ; Choice number ; Chromatic numbers ; Eigenvalues ; Energy ; Energy of a graph ; Energy of graphs ; Graph G ; Graph theory
  8. Source: Linear Algebra and Its Applications ; Volume 429, Issue 11-12 , 2008 , Pages 2687-2690 ; 00243795 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S0024379507005460?via%3Dihub