Further results on permanental bounds for the Laplacian matrix of trees

DOI10.1080/03081080902765583MaRDI QIDQ3589196zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

treeLaplacian matrixpermanent

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)

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

Cites work

• A bound for the permanent of the Laplacian matrix
• Inequalities for determinants and permanents
• Old and new results on algebraic connectivity of graphs
• Permanent of the Laplacian matrix of trees and bipartite graphs
• Permanent of the Laplacian matrix of trees with a given matching
• Permanental polynomials of graphs
• Recent results in the theory of graph spectra
• Schur convex functions on the spectra of graphs

Cited in

(17)

• A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
• 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
• Edge-grafting theorems on permanents of Laplacian matrices of graphs and their applications
• A bound for the permanent of the Laplacian matrix
• Graphs determined by the (signless) Laplacian permanental polynomials
• Permanent of the Laplacian matrix of trees with a given matching
• Permanent of the Laplacian matrix of trees and bipartite graphs
• On the normalized Laplacian permanental polynomial of a graph
• Permanental bounds of the Laplacian matrix of trees with given domination number
• Computing the permanental polynomials of graphs
• Minimal ∞-norm of generalized inverses of the incidence matrix of a tree
• Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
• Laplacian Permanents of Trees
• On the roots of (signless) Laplacian permanental polynomials of graphs

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)