二部图无符号积和多项式根的性质
Properties of the Roots of the Unsigned Permanent Polynomial of Bipartite Graphs
DOI: 10.12677/pm.2026.162030, PDF,   
作者: 王家欣：青海民族大学数学与统计学院，青海 西宁
关键词: 二部图；无符号积和多项式；无符号积和根；Bipartite Graph； Unsigned Permanent Polynomial； Unsigned Permanent Roots
摘要: 令 G 是 n 个顶点的二部图。任意图的所有特征值都是实数，并且一个图是二部图当且仅当其谱关于原点对称。本文主要研究了二部图的无符号积和多项式的根的性质。
Abstract: Let G be a bipartite graph on n vertices. It is well known that all eigenvalues of any graph are real, and that a graph is bipartite if and only if its spectrum is symmetric with respect to the origin. This paper mainly studies the properties of the roots of the unsigned product and sum polynomials of bipartite graphs.
文章引用：王家欣. 二部图无符号积和多项式根的性质[J]. 理论数学, 2026, 16(2): 21-25. https://doi.org/10.12677/pm.2026.162030

参考文献

[1] Minc, H. (1978) Permanents. Addision-Wesley.
[2] Agrawal, M. (2006) Determinant versus Permanent. ICM.
[3] Kasum, D., Trinajstić, N. and Gutman, I. (1981) Chemical Graph Theory. III. On Permanental Polynomial, Croat. Analytica Chimica Acta, 54, 321-328.
[4] Borowiecki, M. (1985) On Spectrum and Per-Spectrum of Graphs. Publications de l’Institut Mathematique, 38, 31-33.
[5] Chou, Q., Liang, H. and Bai, F. (2015) Computing the Permanental Polynomial of the High Level Fullerene C70 with High Precision. Match Communications in Mathematical and in Computer Chemistry, 73, 327-336.
[6] Liu, S. and Zhang, H. (2013) On the Characterizing Properties of the Permanental Polynomials of Graphs. Linear Algebra and Its Applications, 438, 157-172. [Google Scholar] [CrossRef] 
[7] Yan, W. and Zhang, F. (2004) On the Permanental Polynomials of Some Graphs. Journal of Mathematical Chemistry, 35, 175-188. [Google Scholar] [CrossRef] 
[8] Wu, T. and Zhang, H. (2015) Some Analytical Properties of the Permanental Polynomial of a Graph. Ars Combinatoria, 113, 261-267.
[9] Wu, T. and So, W. (2021) Permanental Sums of Graphs of Extreme Sizes. Discrete Mathematics, 344, Article 112353. [Google Scholar] [CrossRef] 
[10] Liu, S. (2017) On the Bivariate Permanent Polynomials of Graphs. Linear Algebra and its Applications, 529, 148-163. [Google Scholar] [CrossRef] 
[11] Valiant, L.G. (1979) The Complexity of Computing the Permanent. Theoretical Computer Science, 8, 189-201. [Google Scholar] [CrossRef] 
[12] Merris, R., Rebman, K.R. and Watkins, W. (1981) Permanental Polynomials of Graphs. Linear Algebra and Its Applications, 38, 273-288. [Google Scholar] [CrossRef] 
[13] Lovász, L. and Plummer, M.D. (1986) Matching Theory. American Mathematical Society.
[14] Borowiecki, M. and Jóźwiak, T. (1983) A Note on Characteristic and Permanental Polynomials of Multigraphs. In: Lecture Notes in Mathematics, Springer, 75-78. [Google Scholar] [CrossRef] 

为你推荐