Академический Документы
Профессиональный Документы
Культура Документы
(01) (i) Draw each of the following graphs. Indicate which are simple or not.
(a) G V, E where V aa, ab, bc, ac and the edges are given as
follows;
1 aa, ab , 2 ab, ac , 3 ac, bc , 4 bc, bc and
5 bc, aa .
(b) G V, E ; where V V1 , V2 , V3 , V4 , V5 , V6 , V7 and
E 1 , 2 , 3 , 4 , 5 , 6 with
1 V1 , V4 , 2 V1 , V2 , 3 V2 , V3 , 4 V4 , V3 , 5 V5 , V6
and 6 V2 , V5
(02) (i) Determine the number of edges in a graph h with 6 nodes 2 of degree
3 and 4 of degree 2 and draw two distinct such graphs.
(ii) Draw at least one graph that satisfies each of the following sets of
specifications or indicate why it is impossible to do so.
(03) (i) Define a connected and complete graph, and draw the complete graph
on five vertices.
(ii) G is the graph whose adjacency matrix a is given by
0 1 0 1 1
1 0 1 0 0
A 0 1 0 0 0
1 0 0 0 1
1 0 0 1 0
(a) If V G a, b, c, d, e find the number of paths of length four
(4) joining vertices d and e.
(b) Without drawing a diagram of G, determine whether G is
connected or not.
1
(c) Draw the graph of following adjacency matrices.
0 1 1 1 0
1 1 0 1 0
0 1 1 1 1
1 1 1
P Q 1 0 1 0 1
1 0 1 0
0 0 1 0 1
0 0 1 1
1 1 1 0 0
Please send the answers to the following address on or before due date according to the
activity schedule.