ABSTRACT
In this chapter, we study information theory on directed graphs. In particular, we compute entropies of graphs. There are lots of different versions of entropies in mathematics and science. We will use classical entropy of finite schemes. Remark that there are several entropy concepts in combinatorics (in graph theory). But we are interested only in classical entropy.
