Question: How much storage is needed to represent a simple graph with n vertices and m edges using
a) adjacency lists?
b) an adjacency matrix?
c) an incidence matrix?
A devil's pair for a purported isomorphism test is a pair of nonisomorphic graphs that the test fails to show that they are not isomorphic.