arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0711.3049math.COmath.SP
收藏

图的惯性反问题

The inverse inertia problem for graphs

Wayne Barrett, H. Tracy Hall, Raphael Loewy

摘要:

设G是n阶无向图,S(G)是所有实对称n × n矩阵的集合,其非零非对角元恰好出现在G的边对应的位置上. G的惯性反问题是问哪些惯性可以由S(G)中的矩阵获得。我们给出了一个完整的答案,这个问题的树在一个新的家庭的图参数,最大不连通数的一个图。我们还利用真子图的惯性集给出了一个求有割点图的惯性集的公式。最后,我们给出了一个例子,图是不惯性平衡的,并调查限制的惯性集的任何图。

英文摘要:

Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G asks which inertias can be attained by a matrix in S(G). We give a complete answer to this question for trees in terms of a new family of graph parameters, the maximal disconnection numbers of a graph. We also give a formula for the inertia set of a graph with a cut vertex in terms of inertia sets of proper subgraphs. Finally, we give an example of a graph that is not inertia-balanced, and investigate restrictions on the inertia set of any graph.

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

↑