arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.1239math.FA
收藏

图和矩阵的最大范数及其补

Maximum norms of graphs and matrices, and their complements

Vladimir Nikiforov, Xiying Yuan

摘要:

本文主要研究图的邻接矩阵的迹范数,也称为图的能量。给出了图及其补图的最大迹范数。事实上,上面的问题是在一个更一般的设置中陈述和解决的-对于有界元素的非负矩阵。特别是,本研究展示了分析矩阵函数达到最大值的矩阵与刚性和复杂的组合结构。在最后一节中,同样的问题进行了研究的Ky Fan范数。进一步研究的可能方向进行了概述,因为事实证明,上述问题只是一个更大的多维研究领域的一角。

英文摘要:

In this paper, we mainly study the trace norm of the adjacency matrix of a graph, also known as the energy of graph. We give the maximum trace norms for the graph and its complement. In fact, the above problem is stated and solved in a more general setup - for nonnegative matrices with bounded entries. In particular, this study exhibits analytical matrix functions attaining maxima on matrices with rigid and complex combinatorial structure. In the last section the same questions are studied for Ky Fan norms. Possibe directions for further research are outlined, as it turns out that the above problems are just a tip of a larger multidimensional research area.

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

↑