options 1 True 2 False SolutionThe two graphs show above hav
options:
| 1) True | |
| 2) False |
Solution
The two graphs show above have two vertices of degree 1 and three vertices of degree 3. and each graph can be morphed to form another (match the other) graph.
Therefore, the two graphs are isomorphic.
Hence, True.
