|
|
|
Dec 04, 2024
|
|
MAT 331 - Combinatorics and Graph Theory Basic counting principles, arrangements and selections, distributions, generating functions, recurrence relations, inclusion/exclusion, basic graph theory, Euler and Hamilton circuits, graph coloring. Prerequisite: a grade of C- or better in MAT 224. (3 cr. hr.)
Frequency code O = offered occasionally
Student Learning Outcomes
Upon successful completion of this course, students will be able to:
- Count the number of ways to arrange and select objects, and compute discrete probabilities.
- Use counting arguments to prove identities.
- Formulate generating functions and use them to solve recurrence relations.
- Analyze and provide examples of graphs with certain properties regarding connectivity, coloring, or planarity.
- Employ common algorithms to find Euler circuits, Hamilton circuits, and minimal spanning trees.
Add to Portfolio (opens a new window)
|
|
|
