arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1709.04009math.CO
收藏

图的特征值分布的猜想界

Conjectured bound for the distribution of eigenvalues of a graph

Pawel Wocjan, Clive Elphick

摘要:

设$(n^+, n^0, n^-)$表示具有$n$顶点的图$G$的惯量。除了$n^-$的上限之外,惯性的Nordhaus-Gaddum界限是已知的。我们猜想,对任何图\[ n^-(G) + n^-(\bar{G}) \le 1.5(n - 1), \],并证明了这一界的各种类的图和几乎所有的图。我们考虑这个界限和位于$-1$到$0$的区间内的特征值的数目之间的关系,我们将其表示为$n_{(-1,0)}(G)$。我们猜想,对任何图\[ n_{(-1,0)}(G) \le 0.5(n - 1). \],并证明这一界几乎所有的图。我们还研究了这两个界限的极值图,并证明了这两个界限对于正则图是等价的。

英文摘要:

Let $(n^+, n^0, n^-)$ denote the inertia of a graph $G$ with $n$ vertices. Nordhaus-Gaddum bounds are known for inertia, except for an upper bound for $n^-$. We conjecture that for any graph \[ n^-(G) + n^-(\bar{G}) \le 1.5(n - 1), \] and prove this bound for various classes of graphs and for almost all graphs. We consider the relationship between this bound and the number of eigenvalues that lie within the interval $-1$ to $0$, which we denote $n_{(-1,0)}(G)$. We conjecture that for any graph \[ n_{(-1,0)}(G) \le 0.5(n - 1). \] and prove this bound for almost all graphs. We also investigate extremal graphs for both bounds and show that both bounds are equivalent for regular graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑