Mathematics Department
California State University-Bakersfield

Description: graphs, Laplacian matrices, spectra of Laplacian matrices
controllability of Laplacian based networked control systems
develop numerical algorithms to analyze controllability of graphs
Instructor: Cesar Aguilar
Meeting Times:  Mon-Thu @ 12:30-2:30 pm
Meeting Place:  Science III, Rm. 214
Office Hours: Mon-Fri 9-10 am
Wed & Thu 2-3 pm


Course Syllabus

Course Notes

Schedule, Homework, and Notes

WeekDatesSections Topics Homework Notes
1 Jun 23 - Jun 27 §2.1-§2.4 graphs, graph operations, trees, connectivity, degree sequence Homework 1
2 Jun 30 - Jul 4 §2.5-§3.2 maximal graphs, matrix representations, matrix-tree theorem
3 Jul 7 - Jul 11 §3.3-§3.5, §4.1-§4.3 continuous Laplacian and energy, networks, Laplacian spectra Homework 2
4 Jul 14 - Jul 18 N/A linear control theory, controllability, graph controllability classes
5 Jul 21 - Jul 28
6 Jul 28 - Aug 1