In an adjacency matrix representation of graph, if the matrix is symmetric and all diagonal values are 0, then the graph is a simple graph.
Yes
No
Answer:
No
Conditions for simple graph
1.There shouldn't be self loop
2.There shouldn't be parallel edges
if the matrix contain 0's on the diagnal from left to right that means the graph dont contain self loop
But if the graph is symetric but the weight is greater than 1 of any side then the graph is not a simple graph
example
020
202
020
in the above exaple the graph contains 0's on diagnols
and it is symetric
but it is not a simple graph becuase it contains parallel edges
Get Answers For Free
Most questions answered within 1 hours.