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(�ar{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 �ar{G}, chi(G), and ch(G) are the complement, the chromatic number, and the choice number of G, respectively.
Recommendations
Cites work
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- On a list-coloring problem
- On Complementary Graphs
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Some relations between rank, chromatic number and energy of graphs
- The Eigenvalues of a Graph and Its Chromatic Number
Cited in
(2)
This page was built for publication: Choice number and energy of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952058)
