0.

1 Graphs
A sequence is a function whose domain is either all the integers between two
given integers or all the integers greater than or equal to a given integer.
Graph: A graph is a set of 2 finite subsets: a nonempty set V(G) of vertices
and a set E(G) of edges, where each edge is associated with a set consisting of
either one or two vertices called its endpoints. The correspondence from edges
to endpoints is called the edge-endpoint function.
Types of edges: One endpoint: Loop; Two or more distinct edges with the
same set of endpoints are said to be parallel.
Types of vertex: Isolated: Isn’t connected to any edge.
Types of graphs: Simple: doesn’t have loops or parallel edges