Format Type: PDF, Docs
Read Online: 839
This textbook, now in its third edition, continues to provide an accessible introduction to discrete mathematics and graph theory. The introductory material on Mathematical Logic is followed by extensive coverage of combinatorics, recurrence relation, binary relations, coding theory, distributive lattice, bipartite graphs, trees, algebra, and Polya’s counting principle. A number of selected results and methods of discrete mathematics are discussed in a logically coherent fashion from the areas of mathematical logic, set theory, combinatorics, binary relation and function, Boolean lattice, planarity, and group theory. There is an abundance of examples, illustrations and exercises spread throughout the book. A good number of problems in the exercises help students test their knowledge. The text is intended for the undergraduate students of Computer Science and Engineering as well as students of Mathematics and those pursuing courses in the areas of Computer Applications and Information Technology. New to The Third Edition Includes a new chapter (Chapter 2) on Methods of proof. Contains new sections on Enumeration of graphs, Branching process in enumerating trees, Pseudo Boolean lattice, and Subgroup. Redistributes most of the problems given in exercises section-wise. Provides many examples and exercises. Gives elaborate hints for solving exercise problems.