Class Syllabus:

Networks and graphs are used in almost all engineering disciplines, from communication to power systems to transportation. This class develops theoretical and algorithmic understanding of networks and graphs. For more complete information on the requirements and expectation of the class, see syllabus.

This is the main website for this class. The Canvas Site is only used to post grades.

Class: Monday, Wednesday, 12:30pm-2:20pm, EEB 042
Instructor: Baosen Zhang,, Office: EEB M310, Office Hour: Wednesday after class


  1. Most of the lectures will be done via the board. Some relevant papers would be posted on this website. There is no required textbook for this class. Some useful books are: “Spectral Graph Theory” by Fan Chung; “Networks: An Introduction” by Mark Newman
  2. I will try to respond to emails within 24 hours. Please write EE559 in the subject.
  3. This is a graduate course, so it is not as “user friendly” as undergraduate classes. I assume that you can learn the elementary topics on your own if needed.

Schedule of Classes:

  1. Introduction, basics of graph theory
  2. Spectral property of graphs
  3. Basics of combinatoric optimization
  4. Linear programming
  5. Duality for graphs
  6. Algorithms
  7. Applications to power systems
  8. Applications to communication and transportation
  9. Application to social networks and biological networks
  10. Project presentations


  1. There will be 4 or 5 homework assignments in the class and a final project. No exams.
  2. Grade distribution: project 50%, homework 30%, class participation 20%

Homework Assignments:

  1. Homework 1, due Jan 18th in class, pdf
  2. Homework 2, due Feb 6th in class, pdf