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

Seidel矩阵的特征值与Haemers猜想

On eigenvalues of Seidel matrices and Haemers' conjecture

Ebrahim Ghorbani

摘要:

对于图$G$,设$S(G)$是$G$的Seidel矩阵,$\te_1(G),...,\te_n(G)$是$S(G)$的特征值。$G$的Seidel能量定义为$|\te_1(G)|+...+|\te_n(G)|$。Willem Haemers证明了具有$n$顶点的图的Seidel能量至少是具有$n$顶点的完全图的Seidel能量$2n-2$.基于这一猜想,我们证明了对于任何具有$0<\al<2$的$\al$,$|\te_1(G)|^\al+...+|\te_n(G)|^\al\g (n-1)^\al+n-1$当且仅当$|{\rm det} S(G)|\g n-1$ .特别地,这意味着Haemers猜想对于所有具有$|{\rm det} S(G)|\g n-1$的图$G$。

英文摘要:

For a graph $G$, let $S(G)$ be the Seidel matrix of $G$ and $\te_1(G),...,\te_n(G)$ be the eigenvalues of $S(G)$. The Seidel energy of $G$ is defined as $|\te_1(G)|+...+|\te_n(G)|$. Willem Haemers conjectured that the Seidel energy of any graph with $n$ vertices is at least $2n-2$, the Seidel energy of the complete graph with $n$ vertices. Motivated by this conjecture, we prove that for any $\al$ with $0<\al<2$, $|\te_1(G)|^\al+...+|\te_n(G)|^\al\g (n-1)^\al+n-1$ if and only if $|{\rm det} S(G)|\g n-1$. This, in particular, implies the Haemers' conjecture for all graphs $G$ with $|{\rm det} S(G)|\g n-1$.

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

↑