A note on the permanental roots of bipartite graphs

DOI10.7151/dmgt.1704zbMath1292.05142OpenAlexW1979563934MaRDI QIDQ2442268

Heping Zhang, Wei Li, Shun-yi Liu

Publication date: 2 April 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1704

zbMATH Keywords

permanentpermanental polynomialpermanental roots

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)

Per-spectral characterizations of some edge-deleted subgraphs of a complete graph ⋮ Per-spectral characterizations of some bipartite graphs ⋮ The graphs whose permanental polynomials are symmetric ⋮ Per-spectral characterizations of graphs with extremal per-nullity ⋮ Constructing graphs which are permanental cospectral and adjacency cospectral ⋮ The coefficients of the immanantal polynomial ⋮ On the permanental nullity and matching number of graphs ⋮ On the matching and permanental polynomials of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 theory
• Permanental polynomials of graphs
• An introduction to matching polynomials
• On the permanental polynomials of some graphs
• Descartes' Rule of Signs Revisited
• Generalized Matrix Functions and the Graph Isomorphism Problem
• Chromatic Polynomials

This page was built for publication: A note on the permanental roots of bipartite graphs