Author:
Wu Tingzeng,Wang Hongge,Zhang Shanjun,Deng Kai
Abstract
AbstractThe permanental sum of a graph G can be defined as the sum of absolute value of coefficients of permanental polynomial of G. It is closely related to stability of structure of a graph, and its computing complexity is #P-complete. Pentagon-chain polymers is an important type of organic polymers. In this paper, we determine the upper and lower bounds of permanental sum of pentagon-chain polymers, and the corresponding pentagon-chain polymers are also determined.
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Reference35 articles.
1. Kasum, D., Trinajstić, N. & Gutman, I. Chemical graph theory. III. On permanental polynomial. Croat. Chem. Acta. 54, 321–328 (1981).
2. Merris, R., Rebman, K. R. & Watkins, W. Permanental polynomials of graphs. Linear Algebra Appl. 38, 273–288 (1981).
3. Cash, G. G. The permanental polynomial. J. Chem. Inf. Comput. Sci. 40, 1203–1206 (2000).
4. Cash, G. G. Permanental polynomials of smaller fullerenes. J. Chem. Inf. Comput. Sci. 40, 1207–1209 (2000).
5. Chen, R. A note on the relations between the permanental and characteristic polynomials of coronoid hydrocarbons. MATCH Commun. Math. Comput. Chem. 51, 137–148 (2004).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献