This document discusses graphs and their properties. It defines a graph as a collection of vertices connected by edges. There are two main types of graphs: directed graphs where edges have orientations, and undirected graphs where edges are bidirectional. Graphs can be represented using an adjacency matrix which stores the connections between vertices. Common graph traversal algorithms discussed are breadth-first search and depth-first search.