INDEX OF TERMS prepared 2006 April by P.E.Luft for K.M.Shannon's Discrete Mathematics Primer
absorption	1.2.0	p   36
addition rule, general	3.4.3	p 160
addition rule, special	3.2.3	p 140
adjacency matrix for a digraph	4.1.6	p 186
adjacency matrix for a graph	4.1.4	p 186			p 192
algorithm	4.0.1	p 178
and	5.1.0	p 227
antisymmetric relation	1.4.5	p   51
associative	1.2.0	p   36
Bayes' Theorem	3.5.2	p 169
bijection, bijective	1.3.4	p   43		3.0.1	p 107
binary tree	4.4.1	p 209
binomial coefficient	3.2.1	p 133
binomial probability distribution	3.2.4	p 141
binomial theorem	3.2.2	p 133
boolean function	5.2.3	p 241
boolean operation	5.2.2	p 240
boolean variable	5.2.1	p 240
cardinality n	A.2	p 268
cardinality, same	A.3	p 268
Cartesian product	1.3.6	p   44
child	4.4.1	p 209
combinatorial coefficient = binomial coefficient
commutative	1.2.0	p   36
complement	1.0.4	p   22		3.1.7	p 122
complement counting	3.1.7	p 122
complementarity	1.2.0	p   36
complete graph	4.0.3	p 181		0.2.0	p  10
composite	0.3.3	p   14
composition	1.3.5	p   43
concensus	1.2.0	p   36
conditional probability	3.5.1	p 167
conjecture	2.0.0	p   78
connected component	4.1.4	p 184
connected component	4.1.4	p 184
contraconverse	2.0.3	p   80
contradiction	2.0.8	p   83
contrapositive	2.0.3	p   80
converse	2.0.3	p   80
cost matrix	4.3.2	p 203
countable	A.6	p 271
cycle	4.1.2	p 183		0.2.0	p    9
Daisy Chain Theorem	4.2.3	p 197
de Bruijn sequence	4.1.3	p 190
De Morgan	1.2.0	p   36
De Morgan's Law	5.1.1	p 231
decision tree	3.0.4	p 108
deduction	5.1.1	p 231
degree of a vertex	4.1.3	p 183
denumerable	A.6	p 271
digraph = directed graph
Dijkstra's algorithm	4.3.4	p 204
dilemma	5.1.1	p 231
directed graph (digraph)	4.0.4	p 181		0.2.0	p    9
distributive	1.2.0	p   36
divides	0.3.2	p   14
divisible	0.3.2	p   14
domain	1.3.1	p   41
double negative	5.1.1	p 231
duality	5.2.2	p 244
edge	4.0.2	p 179		0.2.0	p    9
edge-vertex inequality	4.5.2	p 219
element chasing	1.1.4	p   30
equality of sets	1.0.1	p   20		1.1.2	p   30
equivalence (relation)	1.5.2	p   57
equivalence class counting	3.1.6	p 122
equivalent	5.1.4	p 232
Euler cycle	4.1.2	p 183		0.2.0	p  10		4.1.exr	p 190
Euler cycle algorithm	4.1.1	p 184		4.1.1	p 187
Euler path	0.2.0	p   10		0.2.0	p  10
Euler's Theorem	4.5.1	p 218
even	0.3.5	p   15
event	3.0.2	p 113
excluded middle	5.1.1	p 231
expected value	3.5.2	p 170
experiment	3.0.2	p 113
expression tree	4.4.7	p 211
face	4.5.3	p 218
factor	0.3.2	p   14
Fibonacci sequence	2.2.2	p   96
finite set	A.4	p 268		A.4	270
forest	4.2.1	p 195
function	1.3.1	p   41
gate	5.3.1	p 248
girth	4.5.4	p 219
graph	4.0.2	p 179		0.2.0	p    9
greedy algorithm	4.3.0	p 201
Hamiltonian cycle	4.1.2	p 183
Hasse diagram	1.6.3	p   69
idempotency	1.2.0	p   36
identity	1.2.0	p   36
if … then	5.1.1	p 228
if and only if (iff)	5.1.0	p 227
if then statement	2.0.3	p   80
image	1.3.1	p   41
implicant	5.4.3	p 256
implies	5.1.0	p 227
independent	3.2.2	p 140
induction	2.1.1	p   88
infinite set	A.5	p 268
injection, injective	1.3.2	p   42
integer	0.3.1	p   14
intersection	1.0.2	p   21
inverse = contraconverse	2.0.3	p   80
inverse relation	1.3.7	p   45
involution	1.2.0	p   36
irreflexive partial order(ing)	1.6.4	p   71
irreflexive relation	1.4.3	p   50
isomorphic graphs	4.5.1	p 216
Karnaugh map	5.4.1	p 255
Knuth notation	3.2.11	p 143
Königsburg Bridge	4.1.3	p 183		0.2.0	p    9
loop	4.0.2	p 179
minimal spanning tree	4.3.1	p 201
mod(ulo)	1.5.3	p   59
Modus Ponens	5.1.1	p 231
multigraph	4.0.2	p 179		0.2.0	p    9
multiple edges	4.0.2	p 179		0.2.0	p    9
multiplication rule	3.0.1	p 107
multiset	3.3.0	p 150		3.2.8	p 124
mutually exclusive	3.2.3	p 140
not	5.1.0	p 227
NP Complete	4.0.1	p 180
number	0.3.1	p   14
odd	0.3.5	p   15
one-to-one	1.3.2	p   42
onto	1.3.3	p   42
on-to-one correspondence	A.1	p 268
or	5.1.0	p 227
order	3.0.6	p 109		3.0.6	p 105
ordered samples w/ repetition	3.1.1	p 119
ordered samples w/o repetition	3.1.3	p 119
outcome	3.0.2	p 113
partial order(ing)	1.6.1	p   69		1.6.4	p   71
partition	1.5.1	p   57
path	4.1.1	p 183		0.2.0	p    9
pigeonhole principle	1.3.4	p   43
planar graph	4.5.2	p 217
power set	A.7	p 273
prime	0.3.3	p   14
Prim's algorithm	4.3.1	p 201
principle of inclusion/exclusion	3.4.1	p 156
probability	3.0.3	p 114
product block	5.4.3	p 256
product function	5.4.2	p 256
product notation	2.2.3	p   97
proof	2.0.0	p   78
proof by contradiction	5.1.1	p 231
proper subset	1.0.1	p   20
quantifier, existential	2.3.1	p 100
quantifier, universal	2.3.2	p 100
quotient	0.3.6	p   15
range	1.3.1	p   41
recursion	2.2.2	p   95
redundancy	1.2.0	p   36
reflexive relation	1.4.2	p   50
relation on a set	1.4.1	p   48
relation, related	1.3.6	p   44
relatively prime	0.3.4	p   14
remainder	0.3.6	p   15
repetition	3.0.6	p 109
RGB numbers	1.5.4	p   60
root	4.4.1	p 209
root statement	2.0.3	p   80
sample space	3.0.2	p 113
search algorithm	4.4.3	p 210
separation	5.1.1	p 231
set	1.0.0	p   18
set builder	1.0.1a	p   18
size of a set	1.0.1c	p   19		3.0.1	p 107
spanning tree	4.2.3	p 195		4.3.1	p 201
spanning tree algorithm	4.2.1	p 195
standard deck	3.1.8.8	p 123
strict partial order(ing)	1.6.4	p   71
strong induction	2.2.1	p   94
subgraph	4.2.2	p 195
subset	1.0.1	p   20		3.2.1	p 133
sum notation	2.2.3	p   97
surjection, surjective	1.3.3	p   42
syllogism	5.1.1	p 231
symmetric matrix	4.1.5	p 187
symmetric relation	1.4.4	p   51
tautology	5.1.3	p 229
theorem	5.1.3	p 229
total order(ing)	1.6.2	p   69
transfinite numbers	A.7	p 274
transitive relation	1.4.6	p   52
Traveling Salesman Problem	4.0.1	p 178
tree	4.2.1	p 195
tree diagram	3.0.4	p 108
truth table	1.1.1	p   28
TSP = Traveling Salesman Problem
union	1.0.2	p   21
unordered samples w/o repetition	3.2.1	p 132
unordered samples w/repetition	3.3.1	p 151
Venn diagram	1.1.1	p   27
vertex	4.0.2	p 179		0.2.0	p    9
weighted graph	4.0.3	p 179
well-formed proposition	5.1.1	p 227