Abstract
Let M be an n × n matrix with entries mij (i,j=1,2,…,n). The permanent of M is defined to beper(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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
