Trees

A tree is a connected graph

with no cycles.

Special Trees

Paths

Stars

Complete Graph

A complete graph is a graph in which every vertex is

directly connected by an edge to each of the other
vertices. If the graph has n vertices the connected graph
is denoted by kn.

Directed Graph (digraph)

Edges have directions

An edge is an ordered pair of nodes

loop
multiple arc

arc

node

Incidence Matrices

The incidence matrix for the graph is a matrix representation of the

graph.
Each row represents an edge, and each column represents a node

For a given row, there is a 1 if the edge is leaving the node, and
a 1 if the edge is entering the node, and a 0 otherwise. The
incidence matrix for the graph above is: