首页> 外文期刊>Discrete Applied Mathematics >Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
【24h】

Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree

机译:特征值分配和Hermitian矩阵(图中的树)中的两个最大多重性

获取原文
获取原文并翻译 | 示例
           

摘要

Among the possible multiplicity lists for the eigenvalues of Hermitian matrices whose graph is a tree we focus upon M-2, the maximum value of the sum of the two largest multiplicities. The corresponding M-1 is already understood. The notion of assignment (of eigenvalues to subtrees) is formalized and applied. Using these ideas, simple upper and lower bounds are given for M-2 (in terms of simple graph theoretic parameters), cases of equality are indicated, and a combinatorial algorithm is given to compute M-2 precisely. In the process, several techniques are developed that likely have more general uses.
机译:在图为一棵树的Hermitian矩阵特征值的可能多重性列表中,我们关注M-2,这是两个最大多重性之和的最大值。相应的M-1已经被理解。 (特征值到子树的)分配概念被形式化和应用。利用这些思想,给出了M-2的简单上限和下限(根据简单的图形理论参数),指出了等价情况,并给出了组合算法来精确地计算M-2。在此过程中,开发了几种可能具有更普遍用途的技术。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号