An introduction to discrete mathematics |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
Sets Functions and Proof Techniques | 1 |
Logic and Logic Circuits | 61 |
Relations on Sets | 125 |
Copyright | |
5 other sections not shown
Other editions - View all
Common terms and phrases
A U B according to Theorem algorithm alphabet antisymmetric argument bijection binary relation binary words Boolean function called character code choose compound statement connected graph contain count the number cycle defined definition denote digit directed graph distinguishable balls distinguishable boxes divides equal Equation equivalence relation Eulerian circuit Example Exercises F F F F T F finite state machine formula given graph G Hasse diagram Hence integers Justify your answer label letters logically equivalent maximal element minimum spanning tree multiplication rule natural numbers nonnegative integers number of combinations number of edges number of elements number of subsets one-to-one correspondence order isomorphism partially ordered set partition planar positive integers possible problem Prove rational number real numbers recurrence relation Section sequence shortest path statement variables Suppose symbols tautology transitive true truth table truth values unrestricted repetitions vertex vertices words of length
Bibliographic information
| Title | An introduction to discrete mathematics |
| Author | Steven Roman |
| Edition | illustrated |
| Publisher | Saunders College Publishing, 1986 |
| ISBN | 0030640199, 9780030640193 |
| Length | 455 pages |
| Subjects | › Mathematics / Discrete Mathematics Mathematics / General |
| Export Citation | BiBTeX EndNote RefMan |