You are on page 1of 44

Discrete mathematics (CS232) Dr Mourani Sinha NIIT University, neemrana

Semester II, 2013-14.

Graph Theory 1
Refer: Graph Theory with Applications to Engineering and Computer Science
by Narsingh Deo

AND
Discrete Mathematics and Its Applications Kenneth H. Rosen

Definitions
1. A graph G = (V ,E) consists of a set of objects V = { v1, v2, } called vertices and another set E = { e1, e2, } called edges. 2. Below is a graph or diagram having 5 vertices and 7 edges. 3. An edge having the same vertex as both its end vertices is called a loop. 4. If more than one edge is associated with a given pair of vertices then they are referred to as parallel edges (e4, e5).

5. A graph that has neither loops nor parallel edges is called a simple graph.

6. e2 , e6 , e7 are said to be incident on the same vertex v4 . 7. Two nonparallel edges are said to be adjacent if they are incident on a common vertex (e2 and e7 are adjacent). 8. Two vertices are said to be adjacent if they are the end vertices of the same edge (v4 and v5 are adjacent). 9. The number of edges incident on a vertex vi with loops counted twice is called the degree d(vi) of vertex vi . For example d(v1) = d(v3) = d(v4) = 3, d(v2) = 4, d(v5) = 1.

We have the following terminologies: 1. The two vertices u and v are end vertices of the edge (u, v). 2. Edges that have the same end vertices are parallel. 3. An edge of the form (v, v) is a loop. 4. A graph is simple if it has no parallel edges or loops. 5. A graph with no edges (i.e. E is empty) is empty. 6. A graph with no vertices (i.e. V and E are empty) is a null graph. 7. A graph with only one vertex is trivial. 8. Edges are adjacent if they share a common end vertex. 9. Two vertices u and v are adjacent if they are connected by an edge, in other words, (u, v) is an edge. 10. The degree of the vertex v, written as d(v), is the number of edges with v as an end vertex. By convention, we count a loop twice and parallel edges contribute separately. 11. A pendant vertex is a vertex whose degree is 1. 12. An edge that has a pendant vertex as an end vertex is a pendant edge. 13. An isolated vertex is a vertex whose degree is 0.

v4 and v5 are end vertices of e5. e4 and e5 are parallel. e3 is a loop. The graph is not simple. e1 and e2 are adjacent.
v1 and v2 are adjacent.

The degree of v1 is 1 so it is a pendant vertex. e1 is a pendant edge. The degree of v5 is 5. The degree of v4 is 2. The degree of v3 is 0 so it is an isolated vertex.

Vertex v3 is a pendant vertex. V4 is an isolated vertex. Two adjacent edges are said to be in series if their common vertex is of degree two (the two edges incident on v1).

A directed graph (or digraph) (V ,E) consists of a nonempty set of vertices V and a set of directed edges (or arcs) E. Each directed edge is associated with an ordered pair of vertices. The directed edge associated with the ordered pair (u, v) is said to start at u and end at v.

Refer Rosen Pg 644

Isomorphism

Two graphs G and G are said to be isomorphic if there is a one to one correspondence between their vertices and between their edges such that the incidence relationship is preserved. Suppose that edge e is incident on vertices v1 and v2 in G. Then the corresponding edge e in G must be incident on the vertices v1 and v2 that correspond to v1 and v2 respectively.

Subgraphs
The graph G1 = (V1, E1) is a subgraph of G2 = (V2,E2 ) if V1 V2 and every edge of G1 is also an edge of G2.

The number of edges in a path is called the length of the path.

Connected Graph

A simple path in a graph G that passes through every vertex exactly once is called a Hamilton path, and a simple circuit in a graph G that passes through every vertex exactly once is called a Hamilton circuit.

You might also like