Question

QUESTON TWO (a)Find a traversable trail ? for the graph G whereV(G) = {A, B, C, D} and E(G) = [{A, C}, {A, D}, {B, C}, {B, D}, {C, D}] . [5Marks] (b)Draw the multigraph G whose adjacency matrix is A = ? 0 1 2 0 ? ? 1 1 1 1 ? ? 2 1 0 0 ? ? 0 1 0 1 ? [5Marks] (c)Determine the number of loops and multiple edges in a multigraph G from its adjacency matrix A = ? 1 1 2 0 ? ? 1 2 1 3 ? ? 2 1 0 1 ? ? 0 3 1 0 ? [5Marks] (d)Let G be a graph with m vertices. Describe two major drawbacks in the computer storage of G as its adjacency matrix A. [5Marks] (e)Proove:There is a path from a vertex u to a vertex v if and only if there is a simple path from u to v. [5Marks] TOTAL : [50MARKS]

          QUESTON TWO
(a)Find a traversable trail ? for the graph G whereV(G) = {A, B, C, D} and E(G) = [{A, C}, {A, D}, {B, C}, {B, D}, {C, D}] . [5Marks]
(b)Draw the multigraph G whose adjacency matrix is
A = ? 0 1 2 0 ?
    ? 1 1 1 1 ?
    ? 2 1 0 0 ?
    ? 0 1 0 1 ?
[5Marks]
(c)Determine the number of loops and multiple edges in a multigraph G from its adjacency matrix
A = ? 1 1 2 0 ?
    ? 1 2 1 3 ?
    ? 2 1 0 1 ?
    ? 0 3 1 0 ?
[5Marks]
(d)Let G be a graph with m vertices. Describe two major drawbacks in the computer storage of G as its adjacency matrix A.
[5Marks]
(e)Proove:There is a path from a vertex u to a vertex v if and only if there is a simple path from u to v.
[5Marks]
TOTAL : [50MARKS]

QUESTON TWO
(a)Find a traversable trail ? for the graph G whereV(G) = A, B, C, D and E(G) = [A, C, A, D, B, C, B, D, C, D] . [5Marks]
(b)Draw the multigraph G whose adjacency matrix is
A = ? 0 1 2 0 ?
? 1 1 1 1 ?
? 2 1 0 0 ?
? 0 1 0 1 ?
[5Marks]
(c)Determine the number of loops and multiple edges in a multigraph G from its adjacency matrix
A = ? 1 1 2 0 ?
? 1 2 1 3 ?
? 2 1 0 1 ?
? 0 3 1 0 ?
[5Marks]
(d)Let G be a graph with m vertices. Describe two major drawbacks in the computer storage of G as its adjacency matrix A.
[5Marks]
(e)Proove:There is a path from a vertex u to a vertex v if and only if there is a simple path from u to v.
[5Marks]
TOTAL : [50MARKS]

Added by Jeffrey B.

Question

Please give Ace some feedback