Author: Bert Jagers
Affiliation: University of Twente
Date:12-12-2000
On the Maple Application Center
since Xmas 2000
Minor update:12-12-2001:
on the chromatic polynomial
of a triangular graph
top of the page
The Mathematics in the Cinema Movie "Good Will Hunting"
the multigraph G, its adjacency matrix A and the number of walks in G between two vertices.
the generatingfunction f(z) for the number of walks between two arbitrary, but fixed, vertices of G; in particular the vertices 1 and 3.
two eigenvalue problems on the classroom blackboard.
the chromatic polynomial of a triangular graph, determined jointly by Lambeau and Will by simplifying a rational function for it.
Cayley's theorem on the number of spanning trees in a complete graph.
Home
Maple Application Center