On the (signless) Laplacian permanental polynomials of graphs

DOI10.1007/s00373-019-02033-2zbMath1416.05147OpenAlexW2923411950WikidataQ128176935 ScholiaQ128176935MaRDI QIDQ2000570

Shun-yi Liu

Publication date: 28 June 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-019-02033-2

zbMATH Keywords

coefficient(signless) Laplacian permanental polynomialcopermanental

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Further results on the star degree of 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 ⋮ The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs

Uses Software

• nauty
• Traces

Cites Work

• 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
• Permanent of the Laplacian matrix of trees with a given matching
• Permanental polynomials of graphs
• Enumeration of cospectral graphs.
• Computing the permanental polynomials of graphs
• Multiplicity of integer roots of polynomials of graphs
• Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
• On the characterizing properties of the permanental polynomials of graphs
• Practical graph isomorphism. II.
• Tutte uniqueness of line graphs
• Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
• Further results on permanental bounds for the Laplacian matrix of trees
• Principal subpermanents of the Laplacian matrix
• Laplacian Permanents of Trees
• The Laplacian permanental polynomial for trees
• Edge-grafting theorems on permanents of the Laplacian matrices of graphs and their applications

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