How many different undirected, simple, labeled, 4-vertex, 3-edge graphs can one construct? How about for an n-vertex, m-edge undirected simple labeled graph? What does this say about using metrics...

How many different undirected, simple, labeled, 4-vertex, 3-edge graphs can one construct? How about for an n-vertex, m-edge undirected simple labeled graph? What does this say about using metrics such as size for computing similarity between graphs?