On the roots of (signless) Laplacian permanental polynomials of graphs

DOI10.1007/s00373-023-02710-3zbMath1525.05093MaRDI QIDQ6083184

Tingzeng Wu, Huazhong Lü, Xiao Lin Zeng

Publication date: 31 October 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

permanentcanonical decompositionrook polynomial(signless) Laplacian matrix\(p\)-pendant structure

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permanental bounds of the Laplacian matrix of trees with given domination number
• The complexity of computing the permanent
• Permanent of the Laplacian matrix of trees and bipartite graphs
• Permanental roots and the star degree of a graph
• A bound for the permanent of the Laplacian matrix
• Matching theory
• Permanent of the Laplacian matrix of trees with a given matching
• Permanental polynomials of graphs
• Computing the permanental polynomials of graphs
• Multiplicity of integer roots of polynomials of graphs
• On the (signless) Laplacian permanental polynomials of graphs
• Permanental sums of graphs of extreme sizes
• Further results on the star degree of graphs
• Further results on permanental bounds for the Laplacian matrix of trees
• The Laplacian permanental polynomial for trees
• On the permanental nullity and matching number of graphs
• Generalized Matrix Functions and the Graph Isomorphism Problem

This page was built for publication: On the roots of (signless) Laplacian permanental polynomials of graphs