Further results on permanental bounds for the Laplacian matrix of trees
From MaRDI portal
Publication:3589196
DOI10.1080/03081080902765583zbMATH Open1207.05117OpenAlexW2026591927MaRDI QIDQ3589196FDOQ3589196
Authors: Xianya Geng, Xia Hu, 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
Recommendations
- Permanent of the Laplacian matrix of trees with a given matching
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Permanental bounds of the Laplacian matrix of trees with given domination number
- Edge-grafting theorems on permanents of Laplacian matrices of graphs and their applications
- A bound for the permanent of the Laplacian matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cites Work
- Permanental polynomials of graphs
- Recent results in the theory of graph spectra
- Old and new results on algebraic connectivity of graphs
- Schur convex functions on the spectra of graphs
- Inequalities for determinants and permanents
- A bound for the permanent of the Laplacian matrix
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Permanent of the Laplacian matrix of trees with a given matching
Cited In (17)
- Permanent of the Laplacian matrix of trees with a given matching
- Computing the permanental polynomials of graphs
- On the (signless) Laplacian permanental polynomials of graphs
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
- The permanent of the Laplacian matrix of a bipartite graph
- Computing the permanent of the Laplacian matrices of nonbipartite graphs
- Minimal ∞-norm of generalized inverses of the incidence matrix of a tree
- Laplacian Permanents of Trees
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
- Edge-grafting theorems on permanents of Laplacian matrices of graphs and their applications
- Graphs determined by the (signless) Laplacian permanental polynomials
- On the normalized Laplacian permanental polynomial of a graph
- Permanental bounds of the Laplacian matrix of trees with given domination number
- Permanent of the Laplacian matrix of trees and bipartite graphs
- On the roots of (signless) Laplacian permanental polynomials of graphs
- A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
- A bound for the permanent of the Laplacian matrix
This page was built for publication: Further results on permanental bounds for the Laplacian matrix of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589196)
