## Discrete mathematicsThis best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has the techniques of proofs woven into the text as a running theme and each chapter has the problem-solving corner. The text provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry. For individuals interested in mastering introductory discrete mathematics. |

### What people are saying - Write a review

#### LibraryThing Review

User Review - sloDavid - LibraryThingWhy is this book so tall? Good grief, it's like a notebook. I guess it's easier to fit into one's backpack though. Introduces all the basic concepts of the "science" of computer science. Logic ... Read full review

### Contents

INTRODUCTION | 1 |

COUNTING METHODS AND RECURRENCE RELATIONS | 63 |

GRAPH THEORY | 117 |

Copyright | |

9 other sections not shown

### Other editions - View all

### Common terms and phrases

accepted adjacency matrix argument array Assume automaton of Figure binary tree Boolean algebra Boolean expression categorical proposition colors combinatorial circuit computer science contains defined Definition denote directed edge eight-bit strings elements equation equivalence relation Euler circuit F F F false finite finite-state machine function game tree gates given go to step graph G graph of Figure Hamiltonian circuit Huffman code Inductive Step input isomorphic Kruskal's Algorithm label vertex Let G loop Mathematical Induction maximal flow minimal spanning tree nondeterministic finite-state automaton number of edges obtain one-to-one output Petri planar planar graph player positive integer problem proof real numbers recurrence relation reflexive regular grammar represent root Section shortest path Show shown in Figure solution subgraph subsets subtree Suppose symbols symmetric terminal vertices Theorem tokens transition diagram vertex weighted graph Write a program Write an algorithm xyz V xyz