On the permanental polynomials of matrices

DOI10.1007/s40840-014-0093-xzbMath1322.05074OpenAlexW2055828796MaRDI QIDQ745925

Wei Li, Heping Zhang

Publication date: 15 October 2015

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-014-0093-x

zbMATH Keywords

determinantPfaffian orientationpermanentpermanental polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (2)

The graphs whose permanental polynomials are symmetric ⋮ Enumeration of permanental sums of lattice graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• The complexity of computing the permanent
• Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
• Matching theory
• Permanental polynomials of graphs
• An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix
• Even circuits of prescribed clockwise parity
• Matchings in graphs on non-orientable surfaces
• Pólya's permanent problem
• A characterization of convertible (0,1)-matrices
• On the permanental polynomials of some graphs
• Permanents, Pfaffian orientations, and even directed circuits
• TEMPERATURE DEPENDENCE OF THE RAMAN FREQUENCIES IN THE γ AND β PHASES OF SOLID NITROGEN
• Efficient computation of the characteristic polynomial

This page was built for publication: On the permanental polynomials of matrices