Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
GRAPH- Definition
A graph G consists of two sets
(i) V : a non-empty set whose elements are called vertices(nodes or points) of G.
The set V(G) is called the vertex set of G.
(ii) E : a set E of edges(arcs) which joins two vertices of a graph.
The set E(G) is called the edge set of G.
Thus, a graph is a set of vertices and edges and is represented by G(V,E)
v1 e1 v2
V(G)={v1, v2 , v3 } |V(G)|=3
e3 e2
G
E(G) ={e1, e2 , e3 } |E(G)|=3
v3
e1 e1
e3 e2
e3 e2
2)LOOP
If an edge has the same initial and the terminal points, then it is
called a loop ie,a loop is an edge (u,v) where u=v
3) MULTIPLE EDGES
In a graph ,if there exists two or more than two edges between
any two pair of its vertices,then such edges are called parallel
edges or multiple edges.
1) SIMPLE GRAPH
A graph which has neither loops nor multiple edges is called a simple graph.
2) MULTIGRAPH
A graph which contains multiple edges and loops are not allowed is called a
multigraph.
3) PSEUDOGRAPH
A graph in which loops and multiple edges are allowed is called a pseudograph.