Discrete Mathematics and Its Applications |
Contents
Propositional Equivalences | 11 |
Predicates and Quantifiers | 17 |
1 | 25 |
Copyright | |
18 other sections not shown
Common terms and phrases
a₁ a₂ adjacency matrix algorithm antisymmetric assigned binary search bit strings Boolean function color computer science connected Construct contains DEFINITION denoted determine digits directed graph discrete mathematics equivalence relation Euler circuit Euler path Exercise find the number following example formula grammar graph G Hamilton circuit Hasse diagram Hence inorder input Karnaugh maps least lexicographic order loop mathematical induction multigraph nonnegative integer notation number of edges number of elements ordered pairs ordered rooted tree partial ordering permutation pigeonhole principle planar poset positive integer preorder problem procedure proof proposition R₁ R₂ real numbers recurrence relation reflexive represent Section sequence set of integers shortest path Show shown in Figure simple circuit simple graph Solution solve spanning tree strings of length subgraph subset Suppose symmetric Theorem transitive closure true undirected v₁ variables vertex vertices weighted graph zero-one