Draw every simple graph with five vertices and four edges (isolated vertices are allowed) p to isomorphism (if two graphs are isomorphic, just draw one of them).

Consider a simple graph G with 7 vertices labeled A through G. Suppose that every vertex is connected to every other vertex, except for vertex C, which is only connected to vertex A and vertex B. How many edges does the graph G have?

Give an example of two undirected graphs G1 with nodes {f, s, y, r} and G2 with nodes {t, q, n, p, w}, you can choose your own edges as long as you can give a mapping to show the subgraph- isomorphism

How many possible graphs can be created on 5 distinct vertices?

Let K, be a graph obtained from K, by deleting one edge. How many subgraphs of K, are isomorphic to K, ?