论文标题
关于图形的匹配布置和特征多项式的属性
On the matching arrangement of a graph and properties of its characteristic polynomial
论文作者
论文摘要
本文考虑了一个超平面布置，该编排用图中的所有简单路径的子集构建。建立了构造布置与最大匹配问题的连接。此外，找到特征多项式的问题还原为连接的初始图。当初始图是树时，还发现了特征多项式的公式。
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding the characteristic polynomial is reduced to the case of a connected initial graph. The formula of the characteristic polynomial was also found for the case, when the initial graph is a tree.
