Racquetball problem: A k-racquetball is a graph on k vertices such that k- 1 of these vertices form a k – 1 clique, and the remaining vertex has degree 1, connecting it to the clique. The shape resembles a racquetball because the clique forms a densely connected base, and the degree 1 vertex forms a short handle. Show that, given a graph G on n vertices and a parameter k, finding
OR
OR