图的偏Petrial多项式的递推与系数不等式
Recurrence and coefficient inequality for the partial Petrial polynomial of graphs
AI总结:
本文针对带边图定义了偏Petrial多项式,通过局部补和边旋转操作建立递推关系,并证明多项式的最低次系数不超过最高次系数,等号成立当且仅当图无边。
摘要:
由Gross、Mansour和Tucker引入的带边图的偏Petrial多项式通过欧拉亏格枚举偏Petrial。最近,Deng、Jin和Yan为嫁接图定义了类似物,并证明它可以表示为邻接矩阵的秩生成函数。本文首先证明了一个递推关系,该关系将图关于任意边的偏Petrial多项式简化为三个项的和,这些项涉及通过局部补和边旋转得到的图。该递推将已知的叶约化公式推广到任意正度数的顶点。其次,利用该递推比较多项式的最低次和最高次系数。我们证明最低次系数总是至多等于最高次系数,且等号成立当且仅当图没有边。
英文摘要:
The partial Petrial polynomial of a ribbon graph, introduced by Gross, Mansour and Tucker, enumerates partial Petrials by Euler genus. Recently, Deng, Jin and Yan defined an analogue for grafts and showed that it can be expressed as a rank-generating function of an adjacency matrix. In this paper we first prove a recurrence relation that reduces the partial Petrial polynomial of a graph with respect to an arbitrary edge, expressing it as a sum of three terms involving graphs obtained by local complementation and edge pivoting. This recurrence extends the known leaf-reduction formula to vertices of any positive degree. Second, using this recurrence we compare the lowest and highest degree coefficients of the polynomial. We prove that the lowest coefficient is always at most the highest coefficient, and that equality holds if and only if the graph has no edges.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。