Schaum's Outline of Discrete Mathematics, Third Edition (Schaum's Outlines)

Abelian group, 438
Absolute value, 48, 266
Absorption law, 346, 370
Accepting (yes) states, 306
Ackermann function, 54
Acyclic, 216
Addition principle, 127
Adjacency:
list, 201
matrix, 171, 206
structure (AS), 171, 212
Adjacent:
fundamental products, 383
vertices, 158
Algebra:
Boolean, 368
Fundamental Theorem of, 382
Algebra of:
propositions, 75
sets, 7
Algorithms, 56
Alphabet, 303
Ancestor, 236
AND gate, 378
AND-OR circuit, 379
Antisymmetric relation, 29
Apple-Haken Theorem, 170
Arcs, 201
Arithmetic progression, 12
Arguments, 4, 76
Array, 409
Arrow diagram, 26
Associates, 449
Associative operations, 433

Atoms, 349

Augmented matrix,

AUT(•)(automorphisms), 440

Automaton, 306

linear bounded, 314

pushdown, 314

Average case, 58

Axiom of Choice, 346

B, 368,

Bn, 369

BFS (breadth-first-search), 175,

215

Bakus-Naur form, 313

Base value, 52

Basic rectangle, 386

Bernoulli trials, 158

Biconditional statement, 75

Big O notation, 59

Bijective function, 46

Binary:

addition, 325

log, 50

relation, 24

Binary search tree, 242

complexity of algorithms, 286

Binary tree, 235

complete, 237

extended, 237

similar, 236

Binomial:

coefficients, 90

distribution, 131, 147

Theorem, 90

Bipartite graphs, 163

Bits, 368

matrix, 206

Boolean:

algebra, 368

function, 381

matrix, 206, 422

Bounded, 267, 342

lattices, 348

Breadth-first-search, 176, 215

Bridge (in a graph), 160

C, complex numbers, 2

C(n, r) (combinations), 93

CRT, (Chinese remainder

theorem), 281

Cancelation law, 277, 434

Cantor’s Theorem, 55

Cardinal numbers, 55

inequalities, 62

Cartesian product, 23

Ceiling function, 48

Cells, 10

Chain, 338

Characteristic polynomial, 114

root, 114

Chebyshev’s inequality, 135, 148

Children, 236

Chinese Remainder Theorem,

281

Choice, Axiom of, 346

Chromatic number, 168

Classes of sets, 1, 10

Closable relation, 37

469