论文标题
签名的线图及其最小特征值的类似物
Signed analogue of line graphs and their smallest eigenvalues
论文作者
论文摘要
在本文中，我们表明，所有具有最小特征值的连接的签名图严格大于$ -2 $，并且最低度足够大的签名图等于完整的图形。这是霍夫曼定理的签名类似物。证明是基于我们称为Hermitian矩阵制定的Hoffman的极限定理的内容，以及用于设置签名图的Hoffman Graph and line Graph概念的扩展。
In this paper, we show that every connected signed graph with smallest eigenvalue strictly greater than $-2$ and large enough minimum degree is switching equivalent to a complete graph. This is a signed analogue of a theorem of Hoffman. The proof is based on what we call Hoffman's limit theorem which we formulate for Hermitian matrices, and also the extension of the concept of Hoffman graph and line graph for the setting of signed graphs.
