Welcome in. First stop: counting.

934 lessons · 1,278 problems

Graph Theory & Networks · 16 lessons

‹ Continue: One and One

In graph theory a graph is not a chart. It is a set of points, called vertices, and a set of connections between them, called edges. A road map is a graph once you keep only which places are joined.

  1. 1Vertices, Edges and Degree
  2. 2Simple, Complete and Bipartite Graphs
  3. 3Subgraphs, Connectedness and Trees
  4. 4Directed Graphs and Strong Connectedness
  5. 5The Adjacency Matrix
  6. 6Counting Walks with Matrix Powers
  7. 7The Weighted Adjacency Table
  8. 8Walks, Trails, Paths, Circuits and Cycles
  9. 9Eulerian Trails and Circuits
  10. 10Hamiltonian Paths and Cycles
  11. 11Kruskal’s Algorithm for a Spanning Tree
  12. 12Prim’s Algorithm and the Matrix Method
  13. 13The Chinese Postman Problem
  14. 14The Traveling Salesman Problem
  15. 15The Nearest-Neighbor Upper Bound
  16. 16The Deleted-Vertex Lower Bound

All topics