Notecards:
MATH 223
Basic Digraph Terms
Directed (u,v)-Walks
Digraph Matrices
Isomorphism
Subgraphs
Eulerian Digraphs
Hamiltonian Digraphs
Tournaments
Networks
Multiple Sources / Sinks
Max Flow / Min Cut Theorem
The Labeling Algorithm
Permutations
Combinations
Pascal
Counting Principles
Binomial Theorem
Multinomial Theorem
Some Binomial Identities
P.I.E.
Common Expansions
Exponential Expansions
Multisets
Partitions
Derangements
Generating Functions
Exponential Generating Functions
Recurrence Relations
Linear Recurrence Relations
Non-homogeneous R. R.
Basic Digraph Terms
Prev | Top | Next
Directed (u, v)-Walks
Prev | Top | Next
Digraph Matrices
Prev | Top | Next
Isomorphism
Prev | Top | Next
Eulerian Digraphs
Prev | Top | Next
Hamiltonian Digraphs
Prev | Top | Next
Tournaments
Prev | Top | Next
Multiple Sources / Sinks
Prev | Top | Next
Max Flow / Min Cut Theorem
Prev | Top | Next
The Labeling Algorithm
Prev | Top | Next
Permutations
Prev | Top | Next
Combinations
Prev | Top | Next
Counting Principles
Prev | Top | Next
Binomial Theorem
Prev | Top | Next
Multinomial Theorem
Prev | Top | Next
Some Binomial Identites
Prev | Top | Next
Common Expansions
Prev | Top | Next
Exponential Expansions
Prev | Top | Next
Partitions
Prev | Top | Next
Derangements
Prev | Top | Next
Generating Functions
Prev | Top | Next
Exponential Generating Functions
Prev | Top | Next
Recurrence Relations
Prev | Top | Next
Linear Recurrence Relations
Prev | Top | Next
Non-homogeneous R. R.
Prev | Top | Next
Course:
Discrete And Combinatorial Mathematics
Code:
MATH 223
School:
Malaspina University-College
Teacher:
Valerie Watts
Semester:
Fall 2005
Textbook:
Discrete Mathematics With Graph Theory (2nd edition) by Edgar G. Goodaire & Michael M. Parmenter