On independent star sets in finite graphs

作     者：Rowlinson, Peter 

作者机构：Univ Stirling Inst Comp Sci & Math Math & Stat Grp Stirling FK9 4LA Scotland 

出 版 物：《LINEAR ALGEBRA AND ITS APPLICATIONS》 (线性代数及其应用)

年 卷 期：2014年第442卷

页      面：82-91页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：Eigenvalue Error-correcting code Star set Strongly regular graph Symmetric design 

摘      要：Let G be a finite graph with mu, as an eigenvalue of multiplicity k. A star set for mu. is a set X of k vertices in G such that mu 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. (C) 2013 Elsevier Inc. All rights reserved.