[Definition] Graph Theory

• Graph theory is a branch of discrete mathematics that study the relationship between objects. These objects are called vertices or node that are joined by edges or link/arc.
• Graph theory is a branch of discrete mathematics that study the relationship between objects. These objects are called vertices or node that are joined by edges or link/arc.
• Graph theory is a branch of discrete mathematics that study the relationship between objects. These objects are called vertices or node that are joined by edges or link/arc.
• A graph G = {V , E } consists of V , a non-empty set of vertices (or nodes), and E, a set of edges. Each edge has either one or two vertices associated with it, called its endpoints.
• A graph G = {V , E } consists of V , a non-empty set of vertices (or nodes), and E, a set of edges. Each edge has either one or two vertices associated with it, called its endpoints.
• A graph G = {V , E } consists of V , a non-empty set of vertices (or nodes), and E, a set of edges. Each edge has either one or two vertices associated with it, called its endpoints.
• A graph G = {V , E } consists of V , a non-empty set of vertices (or nodes), and E, a set of edges. Each edge has either one or two vertices associated with it, called its endpoints.
• The dots are called vertices or nodes. V = set of vertices = {1, 2, 3, 4, 5}
• The connection between vertices or nodes are called the edges or link/arc. It is also called as adjacent.
• Graph is a collection of vertices and edges.
• The degree of a vertex is the number of edges on it. d(1) = 1; d(2) = 3; d(3) = 3; d(4) = 2; d(5) = 3 Sum = 1 + 3 + 3 + 2 + 3 = 12
• Adjacency Matrix represents a graph in a table form, containing a row and column for each vertex.
• Adjacency List represents the collection of unordered lists where each list corresponds to a vertex.