Combinatorial and graph-theoretic principles are used in many areas of pure and applied mathematics and also in such fields as electric circuit theory (graph theory, in fact, grew out of Kirchoff's Laws) and quantum physics. Finite element methods, now important in civil engineering, are in part graph-theoretic. Dr. Balakrishnan's book will treat, via its compendium of solved problems, some of the major (programmable) algorithms of graph theory, and, in a separable chapter, will deal with applications of the very powerful Polya Counting Theorem.