A finite number of points (vertices or nodes) connected by lines (edges or arcs).
A finite sequence of edges such that the end vertex of one edge is the start vertex of the next.
A closed path i.e the end vertex of the last edge is the start vertex of the first edge.
A cycle that passes through every vertex of the graph once, and only once, and returns to the start vertex.
A cycle that includes every edge of the graph exactly once (all valencies must be even).
A subset of vertices together with a subset of the edges
All pairs of vertices on the graph are connected ( there is a path between each of them).
One in which there are no loops, i.e no edges with the same vertex at the end, and not more than one edge connecting any pair of vertices.
A graph in which the edges are directed (they have directions associated with them).
A connected graph with no cycles.
A subgraph of a graph G that includes all the vertices of G and is also a tree
Every vertex is connected by an edge to every other vertex. Kn denotes a complete graph with n vertices.
Consists of two sets of vertices, X and Y. The edges only join vertices in X to vertices in Y, not vertices within a set. Kr,s denotes a complete bipartite graph with r vertices in X and s vertices in Y.
No two edges meet one another, except at a vertex to which they are both incident, when the graph is drawn in a plane.
Two graphs, G1 and G2 are isomorphic if they have the same number of vertices, and the degrees of the corresponding vertices are the same.
Each edge of the graph has a number (weight) associated with it. A network satisfies the triangle inequality if, for every triangle, no edge's weight exceeds the sum of the weights of the other two edges.