Question: 1: Ho many k-vertex paths does the graph Kn hav? 2: Ho many k-vertex paths does the graph Kn1,n2 hav? 3: If G = (V,
1: Ho many k-vertex paths does the graph Kn hav?
2: Ho many k-vertex paths does the graph Kn1,n2 hav?
3: If G = (V, E) is a graph with |V| = n, how many induced subgraphs does G hav?
4: How many spanning subgraphs of Kn1,n2 hav exactly m edges?
5: Let G = (V, E) be a graph with m edges. Ho many spanning subgraphs of G hav exactly k edges?
6:Ho many walks in Kn hav length r?
7:. Ho many walks in Kn1,n2 hav length r?
8 Ho many edges are in Kn?
9: Ho many edges are in Kn1,n2 ?
10: Ho many subgraphs of Kn are isomorphic to Kt?
11: Ho many subgraphs of Kn1,n2 are isomorphic to K3,4?
12: Let K-4 be the graph obtained from K4 by deleting an edge. Ho many subgraphs of Kn are isomorphic to K-4 ?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
