Lists, Decisions, and Graphs
by Edward A. Bender, S. Gill Williamson
Publisher: University of California, San Diego 2010
Number of pages: 261
In this book, four basic areas of discrete mathematics are presented: Counting and Listing (Unit CL), Functions (Unit Fn), Decision Trees and Recursion (Unit DT), and Basic Concepts in Graph Theory (Unit GT). At the end of each unit is a list of Multiple Choice Questions for Review.
Home page url
Download or read it online for free here:
by Eric Lehman, F Thomson Leighton, Albert R Meyer - MIT
An introduction to discrete mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: sets, functions, number theory; Discrete structures: graphs, counting; Discrete probability theory.
by Jean Gallier - arXiv
These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual, and I provide a fairly complete account of the basic concepts of graph theory.
by C. D. H. Cooper - Macquarie University
This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.
by Rupinder Sekhon - Connexions
Applied Finite Mathematics covers topics including linear equations, matrices, linear programming (geometrical approach and simplex method), the mathematics of finance, sets and counting, probability, Markov chains, and game theory.