Eigenvalue multiplicity in cubic graphs

被引：10

作者：

Rowlinson, Peter ^{[1
]}

机构：

[1] Univ Stirling, Inst Comp Sci & Math, Math & Stat Grp, Stirling FK9 4LA, Scotland

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2014年 / 444卷

关键词：

Cubic graph; Eigenvalue; Star complement;

D O I：

10.1016/j.laa.2013.11.036

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G be a connected cubic graph of order n with mu as an eigen-value of multiplicity k. We show that (i) if mu is not an element of {-1,0} then k <= 1/2n, with equality if and only if mu = 1 and G is the Petersen graph; (ii) if mu = -1 then k <= 1/2n + 1 with equality if and only if G = K-4; (iii) if mu = 0 then k <= 1/2n + 1 with equality if and only if G = (2K(3)) over bar. (C) 2013 Elsevier Inc. All rights reserved.

引用

页码：211 / 218

页数：8