Computing the permanental polynomials of graphs

DOI10.1016/j.amc.2017.01.052zbMath1411.05130OpenAlexW2587779384MaRDI QIDQ1735410

Tingzeng Wu, Xiaogang Liu

Publication date: 28 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.01.052

zbMATH Keywords

Laplacian matrixpermanentsignless Laplacian matrixLaplacian permanental polynomialsignless Laplacian permanental polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (8)

Graphs determined by the (signless) Laplacian permanental polynomials ⋮ 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 ⋮ On the (signless) Laplacian permanental polynomials of graphs ⋮ The coefficients of the immanantal polynomial ⋮ The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs ⋮ On the normalized Laplacian permanental polynomial of a graph

Cites Work

• Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Per-spectral characterizations of graphs with extremal per-nullity
• Permanental bounds of the Laplacian matrix of trees with given domination number
• The complexity of computing the permanent
• An efficient algorithm for computing permanental polynomials of graphs
• 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
• Permanent of the Laplacian matrix of trees with a given matching
• Permanental polynomials of graphs
• On the permanental polynomials of some 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
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
• Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
• Further results on permanental bounds for the Laplacian matrix of trees
• The Laplacian permanental polynomial for trees
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph
• Characterizing properties of permanental polynomials of lollipop graphs
• Permanents
• Generalized Matrix Functions and the Graph Isomorphism Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the permanental polynomials of graphs