On independent star sets in finite graphs

Let G be a finite graph with μ as an eigenvalue of multiplicity k. A star set for μ is a set X of k vertices in G such that μ is not an eigenvalue of G−X. We investigate independent star sets of largest possible size in a variety of situations. We note connections with symmetric designs, codes, strongly regular graphs, and graphs with least eigenvalue −2.