arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.1940math.SPmath.CO
收藏

允许所有eigenvalue重数为偶数的图

Graphs that allow all the eigenvalue multiplicities to be even

Polona Oblak, Helena Šmigoc

摘要:

设$G$是$n$顶点上的无向图,$S(G)$是所有非零非对角元素恰好出现在对应于$G$的边的位置的$n \times n$实对称矩阵的集合。图$G$的逆本征值问题是确定所有可能出现的列表作为$S(G).$中矩阵的特征值列表的问题。这个问题通常很难回答,并且研究了几个变化,最值得注意的是最小秩问题。本文介绍了判定哪些图$G$存在$S(G)$中特征多项式为平方的矩阵,即其所有特征值的重数为偶数的问题。我们解决这个问题的几个家庭的图。

英文摘要:

Let $G$ be an undirected graph on $n$ vertices and let $S(G)$ be the set of all $n \times n$ real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of $G$. The inverse eigenvalue problem for a graph $G$ is a problem of determining all possible lists that can occur as the lists of eigenvalues of matrices in $S(G).$ This question is, in general, hard to answer and several variations were studied, most notably the minimum rank problem. In this paper we introduce the problem of determining for which graphs $G$ there exists a matrix in $S(G)$ whose characteristic polynomial is a square, i.e. the multiplicities of all its eigenvalues are even. We solve this question for several families of graphs.

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

↑