• A bi-graph consists of two orthogonal structure: a place graph that describes the

nesting of entities, e.g. a phone inside a room, and link graph that provides non-local
hyperlinks between entities, e.g. allowing phone entities to communicate regardless
of location.
• The degree of any vertex v of G is the number of edges incident with vertex v. Each
self-loop is counted twice.

• Two graphs G1 = (V1 , E1 ) and G2 = (V2 , E2 ) are said to be isomorphic if there

exists a function f : V1 → V2 such that

(a) f is one -to one onto i.e., f is bijective.

(b) a , b is an edge in E , if and only if  f ( a ) , f ( b ) is an edge in E

1 2 for

any two elements a , b  V1 .

• A graph G is called as Euler graph if it contains an Euler line in G.
• An open walk in a graph G is called an Euler Path if it contains all the edges of graph
G.
• A graph G is called a Hamiltonian cycle if it contains a Hamiltonian cycle.

• A graph G = (V , E ) is called a Bipartite graph if its’s vertex set V(G) can be

partitioned into two non-empty disjoint subsets V1 ( G ) and V2 ( G ) in such a way

that each edge e  E ( G ) has it’s one end point in V1 ( G ) and other end point in

V2 ( G ) .

• If each vertex of V1 ( G ) is joined with each vertex V2 ( G ) , then the graph G is

called complete bipartite graph and is denoted by Km, n where m and n are the

number of vertices in V1 ( G ) and V2 ( G ) respectively.

Further Reading:

1. Kalika Patrai, “Graph Theory”, S.K. Kataria & Sons, New Delhi

Exercise:

Check your progress

139
1. Which of the following statements for a simple graph is correct?
(a) Every path is a trail
(b) Every trail is a path
(c) Every trail is a path as well as every path is a trail
(d) Path and trail have no relation

2. Which of the following properties does a simple graph not hold?

(a) Must be connected
(b) Must be unweighted
(c) Must have no loops or multiple edges
(d) Must have no multiple edges

3. What is the maximum number of edges in a bipartite graph having 10 vertices?

(a) 24
(b) 21
(c) 25
(d) 16

4. Which of the following is true?

(a) A graph may contain no edge and many vertices
(b) A graph may contain no edges and no vertices
(c) A graph may contain no edges and no vertices
(d) A graph may contain no vertices and many edges

5. For a given graph G having v vertices and e edges which is connected and has no
cycles, which of the following statements is true?
(a) v=e
(b) v=e+1
(c) v+1=e
(d) v=e–1

140
6. For which of the following combinations of the degree of vertices would the
connected graph be eulerian?
(a) 1, 2, 3
(b) 2, 3, 4
(c) 2, 4, 5
(d) 1, 3, 5

7. Which of the following ways can be used to represent a graph?

(a) Adjacency List and Adjacency Matrix
(b) Incidence Matrix
(c) Adjacency list, Adjacency Matrix as well as Incidence Matrix
(d) No way to represent

8. A graph is collection of
(a) Rows and Columns
(b) Vertices and edges
(c) Equations
(d) None of these

9. The degree of any vertex of graph is

(a) The number of edges incident with vertex
(b) Number of vertex in a graph
(c) Number of vertices adjacent to that vertex
(d) Number of edges in a graph

10. If the origin and terminus of a walk are same, the walk is known as
(a) Open
(b) Closed
(c) Path
(d) None of these

141
11. In a graph if e = ( u , v ) means
(a) u is adjacent to v is not adjacent to u
(b) e begins at u and ends at v
(c) u is predecessor and v is successor
(d) both b and c

12. A graph with n vertices will definitely have a parallel edge or self loop if the total
number of edges are
(a) greater than n – 1
(b) less than n (n - 1)
(c) greater than n (n – 1)/2
(d) less than n (n – 1)/2

13. A vertex of a graph is called even or odd depending upon

(a) Total number of edges in a graph is even or odd
(b) Total number of vertices in a graph is even or odd
(c) Its degree is even or odd
(d) None of these

14. The maximum degree of any vertex in a simple graph with n vertices is
(a) n-1
(b) n+1
(c) 2n – 1
(d) N

15. How many onto (or surjective) functions are there from an n-element ( n  2 ) set
to a two-element set?
(a) 2n
(b) 2n – 1

142
 (c) 2n – 2
(d) 2(2n – 2)

16. Circle has

(a) No vertices
(b) Only a vertex
(c) 8 vertices
(d) None of these

17. The complete graph with four vertices has k edges where k is
(a) 3
(b) 4
(c) 5
(d) 6

18. Choose the most appropriate definition of plane graph

(a) A graph drawn in a plane in such a way that any pair of edges meet only at
their end vertices
(b) A graph drawn in a plane in such a way that if the vertex set of graphs set of
graphs can be partitioned into two non-empty disjoint subset x and y in such
a way that each edge of g has one end in X and one end in Y.
(c) A simple graph which is isomorphic to Hamiltonian graph
(d) None of these

19. Length of the walk of a graph

(a) The number of vertices in walk w
(b) The number of edges in walk w
(c) Total number of edges in a graph
(d) Total number of vertices in a graph

143
 20. Which type of graph has all the vertex of the first set connected to all the vertex of
the second set?
(a) Bipartite
(b) Complete Bipartite
(c) Cartesian
(d) Pie

Answer Keys (Exercise)

1-a

2-a

3-c

4-b

5-b

6-a

7-c

8-b

9-a

10-b

11-d

12-a

13-c

14-a

15-c

16-a

144
17-d

18-a

19-b

20-b

145