Affiliation:
1. School of Mathematics and Statistics, Qinghai Nationalities University, Xining 810007, China
Abstract
Let G be a graph with n vertices and m edges. A(G) and I denote, respectively, the adjacency matrix of G and an n by n identity matrix. For a graph G, the permanent of matrix (I+A(G)) is called the permanental sum of G. In this paper, we give a relation between the Hosoya index and the permanental sum of G. This implies that the computational complexity of the permanental sum is NP-complete. Furthermore, we characterize the graphs with the minimum permanental sum among all graphs of n vertices and m edges, where n+3≤m≤2n−3.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Qinghai Province
Reference25 articles.
1. The complexity of computing the permanent;Valiant;Theoret. Comput. Sci.,1979
2. Permanental polynomials of graphs;Merris;Linear Algebra Appl.,1981
3. Chemical graph theory. III. On permanental polynomial;Kasum;Croat. Chem. Acta,1981
4. Shi, Y., Dehmer, M., Li, X., and Gutman, I. (2016). Graph Polynomials, CRC Press.
5. Highly unique network descriptors based on the roots of the permanental polynomial;Dehmer;Inform. Sci.,2017
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献