We, generalize the concept of perfect graphs in terms of additivity of a functional called graph entropy. The latter is an information theoretic functional on a graph G with a probability distribution P on its vertex set. For any fixed P it is sub-additive with respect to graph union. The entropy of the complete graph equals the sum of those of G and its complement GBAR iff G is perfect. We generalize this recent result to characterize all the cases when the sub-additivity of graph entropy holds with equality.