───✱*.。:。✱*.:。✧*.。✰*.:。✧*.。:。*.。✱ ───

A graph is a tuple of a set of vertices, and a set of edges which represent relations between nodes or vertices.

Terms

  • Vertex → a point/node in the graph
  • Edge → unidirectional relation between two vertices
  • Arc → directional relation between two vertices

Subgraph

  • Subsets of a graph

Connected Graphs

  • A path exists between any two vertices

Disconnected Graphs

  • At least one vertex does not have a path to another vertex

Complete Graphs

  • Every vertex is connected/adjacent to every other vertex
  • Edges = 𝑛(𝑛1)2, where 𝑛 is the number of vertices

Cycles

  • A set of vertices that are connected in a closed chain/loop
  • A subgraph with the same number of vertices and edges

Wheels

  • Special vertex that connects all vertices in a cycle

───✱*.。:。✱*.:。✧*.。✰*.:。✧*.。:。*.。✱ ───