Principal subpermanents of the Laplacian matrix
- 1 July 1986
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 19 (4) , 335-346
- https://doi.org/10.1080/03081088608817728
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).Keywords
This publication has 8 references indexed in Scilit:
- The permanent of the Laplacian matrix of a bipartite graphCzechoslovak Mathematical Journal, 1986
- Permanent of the Laplacian matrix of trees and bipartite graphsDiscrete Mathematics, 1984
- The Laplacian permanental polynomial for treesCzechoslovak Mathematical Journal, 1982
- A property of eigenvectors of nonnegative symmetric matrices and its application to graph theoryCzechoslovak Mathematical Journal, 1975
- Subdeterminants and subgraphsČasopis pro pěstování matematiky, 1974
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973
- A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPHProceedings of the National Academy of Sciences, 1954
- The dissection of rectangles into squaresDuke Mathematical Journal, 1940