1: How many k-vertex paths does the graph Kn have? why?

2: How many k-vertex paths does the graph Kn1,n2 have?why?

3: If G = (V, E) is a graph with |V| = n, how many induced subgraphs does G have?why?

4: How many spanning subgraphs of Kn1,n2 have exactly m edges?why?

5: Let G = (V, E) be a graph with m edges. How many spanning subgraphs of G have exactly k edges?why?

6:How many walks in Kn have length r? why?

7:. How many walks in Kn1,n2 have length r?why?

8 How many edges are in Kn? why?

9: How many edges are in Kn1,n2 ?why?

10: How many subgraphs of Kn are isomorphic to Kt?why?

11: How many subgraphs of Kn1,n2 are isomorphic to K3,4?why?

12: Let K-4 be the graph obtained from K4 by deleting an edge. How many subgraphs of Kn are isomorphic to K-4 ?why?