On the von Neumann entropy of a graph

The von Neumann entropy of a nonempty graph provides a mean of characterizing the information content of the quantum state of a physical system. We give sharp upper and lower bounds for the von Neumann entropy of a nonempty graph using graph parameters and characterize the graphs when each bound is attained. These upper (lower, respectively) bounds are shown to be incomparable in general by examples.