Cayley Graphs: Properties and Applications

Covers the analysis of functions, composition, and mathematical induction.

Explores finding the equation of the tangent line to a function's graph at a point.

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.