Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
Authors:
- 18 February 2011
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 59 (2) , 145-158
Abstract
Let G be a graph and let Q(G) be its signless Laplacian matrix. When G is a unicyclic (respectively, bipartite) graph we obtain sharp upper and lower bounds for the permanent of Q(G) in terms of the order of G. Improved bounds are obtained in terms of the given girth of G. In each of these cases, we characterize the extremal graphs.Keywords
This publication has 23 references indexed in Scilit:
- New permanental upper bounds for nonnegative matricesLinear and Multilinear Algebra, 2003
- Extending the minc-brègman upper bound for the permanentLinear and Multilinear Algebra, 2000
- On the Permanent of Certain (0, 1) Toeplitz MatricesLinear Algebra and its Applications, 1997
- A characterization of the smallest eigenvalue of a graphJournal of Graph Theory, 1994
- Permanent of the Laplacian matrix of trees and bipartite graphsDiscrete Mathematics, 1984
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Monotonicity of positive semidefinite Hermitian matricesProceedings of the American Mathematical Society, 1972
- Bounds for permanents of non-negative matricesProceedings of the Edinburgh Mathematical Society, 1969
- The Hadamard theorem for permanentsProceedings of the American Mathematical Society, 1964
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matricesBulletin of the American Mathematical Society, 1963