Date : / / Module - I Page 00/01/2020 Gray Graph 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 also ciated with it, called its end points. An edge is said to connect its endpoint. Infinite graph A graph with an infinite vertex set is called an infinite graph. Finite graph A graph with finite vertices is called a finite graph Simple graph A graph in which each edge connects two different vertices and where no two edges connect the same pair of vertices is called a simple graph.
Multigraph Graphs that may have multiple are edges connecting the same vertices called multigraph Loops Edges that connects. a vertex to itself are called loops. Pseudograph Graph with multiple edges and loops connecting same pair of vertices DR Graphs that may include loops and possibly multiple edges connecting the same pair of vertices are called pseudo graph a e4 d e5 el e3 the b e2 C e7 e6 Directed graph / Digraph A directed graph or digraph (v, E) consists