updated: 2022-05-05_10:54:07-04:00

Terminology

  • A graph G = (V,E) consists of:
    • A set of vertices V
    • A set of edges E
  • Graphs with a few edges are sparse
  • Graphs with lots of edges are dense
  • Graphs with all possible edges are complete

Pasted image 20220505104325

A cycle is a loop of length >= 3