On the (Signless) Laplacian Permanental Polynomials of Graphs
Author:
- 21 March 2019
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 35 (3) , 787-803
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11501050)
- Fundamental Research Funds for the Central Universities (300102129109, 300102128201)
- Fundamental Research Funds for the Central Universities (300102128104)
This publication has 20 references indexed in Scilit:
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphsLinear and Multilinear Algebra, 2011
- Further results on permanental bounds for the Laplacian matrix of treesLinear and Multilinear Algebra, 2010
- Tutte uniqueness of line graphsDiscrete Mathematics, 2005
- Enumeration of cospectral graphsEuropean Journal of Combinatorics, 2004
- Multiplicity of integer roots of polynomials of graphsLinear Algebra and its Applications, 1995
- Permanent of the laplacian matrix of trees with a given matchingDiscrete Mathematics, 1986
- Principal subpermanents of the Laplacian matrixLinear and Multilinear Algebra, 1986
- Research problemsLinear and Multilinear Algebra, 1984
- Permanent of the Laplacian matrix of trees and bipartite graphsDiscrete Mathematics, 1984
- The complexity of computing the permanentTheoretical Computer Science, 1979