Contents

-

Star Sets in Regular Graphs

Peter Rowlinson1
1Mathematics & Statistics Group Department of Computing Science & Mathematics University of Stirling Scotland, FK9 4LA

Abstract

Let G be a finite graph and let μ be an eigenvalue of G of multiplicity k. A star set for μ may be characterized as a set X of k vertices of G such that μ is not an eigenvalue of GX. It is shown that if G is regular then G is determined by μ and GX in some cases. The results include characterizations of the Clebsch graph and the Higman-Sims graph.