Introductory Discrete Mathematics

By V.K. Balakrishnan

Book Overview

Concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms to solve these problems. Applications are emphasized and more than 200 exercises help students test their grasp of the material. Appendix. Bibliography. Answers to Selected Exercises.

• Format: Paperback
• Language: English
• ISBN: 0486691152
• ISBN13: 9780486691152
• Release Date: October 2010
• Publisher: Dover Publications
• Length: 256 Pages
• Weight: 0.84 lbs.
• Dimensions: 0.5" x 6.5" x 9.2"

Customer Reviews

Excellent Text

As with any Dover text, it is important to remember that this text is designed to teach the material, not to coddle the reader. This text provides broad and deep coverage of the various topics that fall under discrete mathematics (set theory, boolean logic, graph theory, etc.) with clarity and simplicity. This book is not designed to help you pass a test, but is instead designed to help you grasp and understand the topic, which it does very well. Easily the best book I own on this topic (I often joke that the author covered my first semester course on discrete math in the first chapter!).

Excellent introduction to Discrete Mathematics

I was misled by the low price thinking this would be a bad book. But I was Mathematics. The reason for which I bought this text book is because it has many proofs and in particular it includes the proofs of a couple of theorems I had been looking for. The presentation is formal but clear. The author includes plenty of excercises and answers are provided for odd numbered ones. So far I haven't found errors or typos. The book has enough material to be used in a two semester course sequence. I would give it a relations, total and partial orders, logic, combinatorics, regular languages, graphs, number theory, algorithm analysis and even NP-completeness. This book should be useful for both Math and CS students.