An excellent introduction to graph theory, this book covers all relevant concepts in a lucid and rigorous manner. Apart from basic concepts such as tree, isomorphism, transversal, colouring, networks and matching, the notion of matroids has been covered. Special characteristics of this book on graph theory are algorithms provided for each applicable feature such as shortest path between two vertices, connectivity of a graph, minimal spanning tree of a graph and maximum flow in a network. Thereby making it a useful text for students of computer science, information technology, mathematics and statistics.

• • Algorithms explained in a lucid manner • Several worked out examples to understand the concepts and techniques

Preface / Algebraic Prerequisites / Graphs and Subgraphs / Special Graphs / Connectivity and Trees / Planar Graphs / Digraphs / Matching / Algorithms / Applications / Bibliography.

Postgraduate Students and Professionals