MATH 341Graph Theory/Combinatorics

California Lutheran University · 4.0 credits · UGRD

Catalog

The course extends upon concepts introduced in Discrete Mathematics. Graph theory concepts include isomorphism, planarity, Eulerian circuits, and colorings. Network optimization concepts include minimum spanning trees, shortest path, traveling salesperson problem, maximum flow, and matching. Concepts in combinatorics include permutations, combinations, arrangements, distribution, binomial identities, generating functions, and recurrence relations. Students will be required to write proofs for theorems and pseudocode for algorithms.Prerequisite: Math 241.

Recent sections

Spring 2027 · 1 section

Jan 20 – May 14

SectionDays & timeLocationInstructor
01Class #121300Mo We Fr · 11:45 AM – 12:50 PMHumanities 119Dr. John Villalpando