Abstract
The subdeterminants of the Laplacian matrix L(G) assigned to a graph G have a well-known combinatorial meaning. In the present paper principal subpermanents per LK (G) and coefficients pk (G) of the permanental characteristic polynomial of L(G) are expressed by means of some collections of subgraphs of G. This expansion is used to obtain lower bounds for perL(G),per LK (G) and pk (G).
Sign-in/Register to access full text options 
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.
