On the Permanental Polynomial and Permanental Sum of Signed Graphs

DOI10.47443/dml.2022.005OpenAlexW4213431428MaRDI QIDQ5054779

Hanyuan Deng, Zikai Tang, Qiyue Li

Publication date: 9 December 2022

Published in: Discrete Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.47443/dml.2022.005

zbMATH Keywords

adjacency matrixrecursion formulaspermanental polynomialcoefficientpermanental sum

Mathematics Subject Classification ID

Graph polynomials (05C31) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• The complexity of computing the permanent
• Matching theory
• Permanental polynomials of graphs
• Further results on the nullity of signed graphs
• On the permanental polynomials of some graphs
• Unicyclic graphs with second largest and second smallest permanental sums
• Permanental sums of graphs of extreme sizes
• On the permanental sum of bicyclic graphs
• On the permanental sum of graphs
• The extremal permanental sum for a quasi-tree graph
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
• On the permanental nullity and matching number of graphs

This page was built for publication: On the Permanental Polynomial and Permanental Sum of Signed Graphs