A note on the permanental roots of bipartite graphs

DOI10.7151/DMGT.1704MaRDI QIDQ2442268zbMATH OpenOpenAlexFDO

Authors Heping Zhang, Wei Li, Shunqin Liu

Publication date 2 April 2014

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

permanentpermanental polynomialpermanental roots

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3929044
• The graphs whose permanental polynomials are symmetric
• Per-spectral characterizations of graphs with extremal per-nullity
• Per-spectral characterizations of some bipartite graphs
• On the permanental polynomials of some graphs

Cites work

• An introduction to matching polynomials
• Chromatic Polynomials
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Descartes' Rule of Signs Revisited
• Generalized Matrix Functions and the Graph Isomorphism Problem
• scientific article; zbMATH DE number 3831985 (Why is no real title available?)
• scientific article; zbMATH DE number 3811615 (Why is no real title available?)
• scientific article; zbMATH DE number 3929044 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1890155 (Why is no real title available?)
• scientific article; zbMATH DE number 2121258 (Why is no real title available?)
• scientific article; zbMATH DE number 6256206 (Why is no real title available?)
• Matching theory
• On the permanental polynomials of some graphs
• Permanental polynomials of graphs
• The complexity of computing the permanent

Cited in

(11)

• The graphs whose permanental polynomials are symmetric
• Constructing graphs which are permanental cospectral and adjacency cospectral
• The coefficients of the immanantal polynomial
• On the matching and permanental polynomials of graphs
• Per-spectral characterizations of some bipartite graphs
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
• scientific article; zbMATH DE number 3929044 (Why is no real title available?)
• Per-spectral characterizations of graphs with extremal per-nullity
• On the permanental nullity and matching number of graphs
• scientific article; zbMATH DE number 6469239 (Why is no real title available?)
• A note on graphs with purely imaginary per-spectrum

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442268)