Let n 24 and let Rn be a graph with vertex set {x1,...,xn) U (y) and...

 

Transcribed Image Text:

Let n 24 and let Rn be a graph with vertex set {x1,...,xn) U (y) and the following edges: • {x1, x2), (x2, x3},..., (xn-1, xn), (xn, x1), and . . • {xi, y} for every 1 sisn. a) Draw the graph R6. b) How many edges are in Rn? c) How many paths of length 2 does Rn have? d) How many subgraphs of Rn (where n ≥ 4) are isomorphic to K-4 (i.e. K4 with an edge removed)? Let n 24 and let Rn be a graph with vertex set {x1,...,xn) U (y) and the following edges: • {x1, x2), (x2, x3},..., (xn-1, xn), (xn, x1), and . . • {xi, y} for every 1 sisn. a) Draw the graph R6. b) How many edges are in Rn? c) How many paths of length 2 does Rn have? d) How many subgraphs of Rn (where n ≥ 4) are isomorphic to K-4 (i.e. K4 with an edge removed)?