Algebraic Graph Theory - Class Notes
From Algebraic Graph Theory Chris Godsil and Gordon Royle, Graduate Texts in Mathematics 207 (Springer, 2001)
Godsil and Royle's Algebraic Graph Theory book

ETSU does not have a formal class on Algebraic Graph Theory. However, we do have a Graph Theory sequence. Notes are online for Graph Theory 1 (MATH 5340) and Graph Theory 2 (MATH 5450). The catalog description for Graph Theory 1 is: "Topics include special classes of graphs, distance in graphs, graphical parameters, connectivity, Eulerian graphs, hamiltonian graphs, networks, and extremal graph theory. Theory and proof techniques will be emphasized." The catalog description for Graph Theory 2 is: "Analyze topics in planar graphs, the Four Color Theorem, vertex/edge colorings, random graphs, and contemporary research topics in graph theory."

Copies of the classnotes are on the internet in PDF format as given below. The notes and supplements may contain hyperlinks to posted webpages; the links appear in red fonts. The "Proofs of Theorems" files were prepared in Beamer. The "Printout of Proofs" are printable PDF files of the Beamer slides without the pauses. These notes have not been classroom tested and may have typographical errors.

  1. Chapter 1. Graphs.
  2. Chapter 2. Groups.
  3. Chapter 3. Transitive Graphs.
  4. Chapter 4. Arc-Transitive Graphs.
  5. Chapter 5. Generalized Polygons and Moore Graphs.
  6. Chapter 6. Homomorphisms.
  7. Chapter 7. Kneser Graphs.
  8. Chapter 8. Matrix Theory.
  9. Chapter 9. Interlacing.
  10. Chapter 10. Strongly Regular Graphs.
  11. Chapter 11. Two-Graphs.
  12. Chapter 12. Line Graphs and Eigenvalues.
  13. Chapter 13. The Laplacian of a Graph.
  14. Chapter 14. Cuts and Flows.
  15. Chapter 15. The Rank Polynomial.
  16. Chapter 16. Knots.
  17. Chapter 17. Knots and Eulerian Cycles.

1. Graphs.

2. Groups.

3. Transitive Graphs.

4. Arc-Transitive Graphs.

5. Generalized Polygons and Moore Graphs.

6. Homomorphisms.

7. Kneser Graphs.

8. Matrix Theory.

9. Interlacing.

10. Strongly Regular Graphs.

11. Two-Graphs.

12. Line Graphs and Eigenvalues.

13. The Laplacian of a Graphs.

14. Cuts and Flows.

15. The Rank Polynomial.

16. Knots.

  • 16.1. Knots and Their Projections.
  • 16.2. Reidemeister Moves.
  • 16.3. Signed Plane Graphs.
  • 16.4. Reidemeister Moves on Graphs.
  • 16.5. Redemeister Invariants.
  • 16.6. The Kauffman Bracket.
  • 16.7. The Jones Polynomial.
  • 16.8. Connectivity.

17. Knots and Eulerian Cycles.


Return to Bob Gardner's home page