Question

Following is an adjacency matrix of an undirected graph. Assuming the order
of the vertices a, b, c, d, e, show that the handshaking theorem holds for this
graph.
[




[0 1 0 1 0
1 1 0 1 0
0 0 1 0 0
1 1 0 0 1
0 0 0 1 0]

Answer 1

Explanation:

cp.juycotylfk kogkykcky