Graph theory question

Question

In K_n, C_n(n≥3) and W_n(n≥3) how many vertices are there

Answer 1

The subscript n will tell you how to figure out how many vertices.

K_n, and C_n(n≥3) will have all n vertices - e.g., K₄ has 4 vertices, C₆ has 6 vertices.

W_n(n≥3) will have n+1 vertices, as the n will determine how many of those vertices go around the wheel (though some authors use it to denote all the vertices, including the one in the center. Since you specified n≥3 we're not using this definition.) - e.g., W₆ has 7 vertices.