Elsevier, Linear Algebra and its Applications, (442), p. 82-91
DOI: 10.1016/j.laa.2013.06.009
Full text: Download
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.