Choice number and energy of graphs
From MaRDI portal
Publication:952058
DOI10.1016/J.LAA.2007.11.028zbMath1190.05063arXiv0712.0920OpenAlexW2102844876MaRDI QIDQ952058
Saieed Akbari, Ebrahim Ghorbani
Publication date: 6 November 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0712.0920
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Some relations between rank, chromatic number and energy of graphs
- On a list-coloring problem
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
- On Complementary Graphs
- The Eigenvalues of a Graph and Its Chromatic Number
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Choice number and energy of graphs
