Further results on permanental bounds for the Laplacian matrix of trees
From MaRDI portal
Publication:3589196
DOI10.1080/03081080902765583zbMath1207.05117OpenAlexW2026591927MaRDI QIDQ3589196
Xia Hu, Xianya Geng, Shuchao Li
Publication date: 20 September 2010
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081080902765583
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (9)
Graphs determined by the (signless) Laplacian permanental polynomials ⋮ On the roots of (signless) Laplacian permanental polynomials of graphs ⋮ A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials ⋮ Computing the permanent of the Laplacian matrices of nonbipartite graphs ⋮ Computing the permanental polynomials of graphs ⋮ Permanental bounds of the Laplacian matrix of trees with given domination number ⋮ On the (signless) Laplacian permanental polynomials of graphs ⋮ Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial ⋮ On the normalized Laplacian permanental polynomial of a graph
Cites Work
- Schur convex functions on the spectra of graphs
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Old and new results on algebraic connectivity of graphs
- A bound for the permanent of the Laplacian matrix
- Permanent of the Laplacian matrix of trees with a given matching
- Permanental polynomials of graphs
- Recent results in the theory of graph spectra
- Inequalities for determinants and permanents
This page was built for publication: Further results on permanental bounds for the Laplacian matrix of trees
