Let G be a graph with 5 vertices. The adjacency matrix of G is shown below.
|
A |
B |
C |
D |
E |
A |
0 |
1 |
1 |
1 |
0 |
B |
1 |
0 |
1 |
0 |
0 |
C |
0 |
1 |
0 |
1 |
0 |
D |
1 |
0 |
0 |
0 |
1 |
E |
1 |
0 |
0 |
0 |
1 |
Explain what the fact that the adjacency matrix is not symmetrical about the leading diagonal means with respect to the associated graph.
Draw the graph of G.
Determine whether G is Eulerian, semi-Eulerian or neither. Justify your answer.
Did this page help you?