Given 2 graphs are isomorphic or not? a) be bs br Solution If two graphs are isomorphic, they must have: - the same number of vertices - the same number of edges - the same degrees for corresponding vertices - the same number of connected components - the same number of loops we see that each properties satisfy , so they are isomorphic..