Scribd
Upload
55 views9 pages

1 GT

A graph G consists of a set of vertices V and a set of edges E that connect the vertices. An edge can be either directed, with an orientation between its two endpoints, or undirected, without orientation. A finite graph has a finite number of vertices and edges, while an infinite graph does not. Additional graph types include simple graphs (no loops or multiple edges), multigraphs (allowing multiple edges but no loops), and pseudographs (allowing both loops and multiple edges).

Uploaded by

Arush
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
55 views9 pages

1 GT

A graph G consists of a set of vertices V and a set of edges E that connect the vertices. An edge can be either directed, with an orientation between its two endpoints, or undirected, without orientation. A finite graph has a finite number of vertices and edges, while an infinite graph does not. Additional graph types include simple graphs (no loops or multiple edges), multigraphs (allowing multiple edges but no loops), and pseudographs (allowing both loops and multiple edges).

Uploaded by

Arush
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

GRAPH THEORY

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

e1={v1,v2}={v2,v1} unordered pair e1=(v1,v2)≠(v2,v1) ordered pair


e2={v2,v3} e2=(v2,v3)
e3={v1,v3} e3=(v3,v1)
An undirected graph G consists of a A directed graph (or digraph) G consists
set V of vertices and a set E of edges that of a set V of vertices and a set E of edges
are unordered pairs of distinct vertices. that are ordered pairs of distinct vertices.
Here, G(V,E) is a undirected graph where, Here, G(V,E) is a directed graph where,
V(G)={v1, v2 , v3 } V(G)={v1, v2 , v3 }
E(G) ={e1, e2 , e3 } E(G) ={e1, e2 , e3 }
where ei are unordered pairs where ei are ordered pairs
u1
e1 e2
u2 v1 v2

e1={u1,u2} is undirected edge in e2=(v1,v2) is directed edge in a


an undirected graph then digraph then
1) u1 and u2 are the end vertices 1) v1 is initial vertex of e2 and
or end points of e1 v2 is the terminal vertex of e2
2) e1 is incident on both u1 and u2 2) e2 is incident from v1 and
3) u1 is adjacent to u2 and incident to v2
u2 is adjacent to u1 3) v1 is adjacent to v2 and v2 is
adjacent from v1
adjacent-two vertices are adjacent
incident-an edge is incident on a vertex
1)FINITE GRAPH
A graph G(V,E) is said to be finite if it has finite number of
vertices and finite number of edges otherwise it is called infinite
graph.
If G is finite then |V| is called the order of graph G and |E| is
called the size of G.

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.

You might also like