论文标题
某些类图类型的类型-PQ邻接型象征量
Normalized Volumes of Type-PQ Adjacency Polytopes for Certain Classes of Graphs
论文作者
论文摘要
与简单图相关联的类型PQ邻接多层是$ 0/1 $ - 多层设备，其中包含有关基础电源网络的有价值信息。 Chen和第一作者最近证明，当连接基础图$ G $时，可以通过计算满足由$ g $确定的限制的非负整数的序列来计算邻接多型的归一化量。本文以他们的工作为基础，即表明他们的主要结果之一（所谓的“三角复发”）适用于更一般的环境。当通过删除从完整图的路径或周期获得$ g $获得$ g $时的公式。
The type-PQ adjacency polytope associated to a simple graph is a $0/1$-polytope containing valuable information about an underlying power network. Chen and the first author have recently demonstrated that, when the underlying graph $G$ is connected, the normalized volumes of the adjacency polytopes can be computed by counting sequences of nonnegative integers satisfying restrictions determined by $G$. This article builds upon their work, namely by showing that one of their main results -- the so-called "triangle recurrence" -- applies in a more general setting. Formulas for the normalized volumes when $G$ is obtained by deleting a path or a cycle from a complete graph are also established.
