Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5775833 | Applied Mathematics and Computation | 2017 | 11 Pages |
Abstract
Let M be an n à n matrix with entries mij (i,j=1,2,â¦,n). The permanent of M is defined to be
per(M)=âÏâi=1nmiÏ(i),where the sum is taken over all permutations Ï of {1,2,â¦,n}. The permanental polynomial of M is defined by per(xInâM), where In is the identity matrix of size n. In this paper, we give recursive formulas for computing permanental polynomials of the Laplacian matrix and the signless Laplacian matrix of a graph, respectively.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Xiaogang Liu, Tingzeng Wu,