Selected topics from the theory of graph energy: hypoenergetic graphs

Abstract

A graph G with n vertices is said to be hypoenergetic if E(G)<n. In this chapter we outline some selected topics from the theory of graph energy. The main part of this chapter is concerned with the characterization of graphs satisfying the inequalities E(G)<n and E(G) 'greater or equal to' n.