Scribd
Upload
6 views3 pages

Worksheet On Analytical and Computational Methods of Graph Theory

The document is a worksheet by Mehari K. (Ph.D.) focused on analytical and computational methods in graph theory. It includes various questions related to graph representation, such as constructing incidence and adjacency matrices, analyzing directed and undirected graphs, and deriving path matrices. The exercises aim to deepen understanding of graph properties and matrix operations in the context of graph theory.

Uploaded by

kaleab tadesse
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
6 views3 pages

Worksheet On Analytical and Computational Methods of Graph Theory

The document is a worksheet by Mehari K. (Ph.D.) focused on analytical and computational methods in graph theory. It includes various questions related to graph representation, such as constructing incidence and adjacency matrices, analyzing directed and undirected graphs, and deriving path matrices. The exercises aim to deepen understanding of graph properties and matrix operations in the context of graph theory.

Uploaded by

kaleab tadesse
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/ 3

Worksheet

On
Analytical and computational methods of graph theory
By Mehari K.(Ph.D.)

Answer all the following Questions

1. Consider the graph G with vertices V={A,B,C,D} and edges


E={e1,e2,e3,e4,e5},
where:
o e1 connects A and B,
o e2 connects B and C,
o e3 connects C and D,
o e4 connects D and A,
o e5 connects B and D.
Write the incidence matrix for this graph G.
2. A graph G has 5 vertices and 7 edges. Its incidence matrix has 5 rows and 7
columns.
Determine whether this graph is directed or undirected, and explain how the
incidence matrix differs between these two types of graphs.
3. Consider the directed graph G with vertices V={A,B,C}
where:
o There is an edge from A to B,
o There is an edge from B to C,
o There is an edge from C to A.
Write the adjacency matrix of G.
4. Given the adjacency matrix A of an undirected graph as:
0 1 1
𝐴= 1 0 1
1 1 0
Draw the corresponding graph and verify its adjacency matrix.

5. For the adjacency matrix A of a graph, the (i,j)-th entry of A2 represents the
number of 2-step paths between vertex i and vertex j.
Prove this property using matrix multiplication and provide an example with
a simple graph.
6. Consider the graph with the adjacency matrix:

0 1 1
𝐴= 1 0 1
1 1 0

Compute A2 and A3, and interpret their meanings in terms of the paths between
vertices.

7. A path matrix P of a graph indicates the existence of paths of any length


between vertices (1 for a path exists, 0 otherwise). For the graph below:

0 1 0
𝐴= 1 0 1
0 1 0

Derive the path matrix P by computing I + A + A2, where I is the identity


matrix.
8. Consider a graph G where Ak[i][j] ≠ 0 represents the existence of a path of
length k from vertex i to vertex j.
Explain how the path matrix helps determine whether the graph is
connected, and provide an example.

You might also like