A note on the permanental roots of bipartite graphs

DOI10.7151/DMGT.1704zbMATH Open1292.05142OpenAlexW1979563934MaRDI QIDQ2442268FDOQ2442268

Authors: Heping Zhang, Wei Li, Shunqin 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

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

zbMATH Keywords

permanental polynomialpermanentpermanental roots

Mathematics Subject Classification ID

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

Cites Work

• Matching theory
• The complexity of computing the permanent
• Permanental polynomials of graphs
• On the permanental polynomials of some graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized Matrix Functions and the Graph Isomorphism Problem
• Descartes' Rule of Signs Revisited
• An introduction to matching polynomials
• Title not available (Why is that?)
• Chromatic Polynomials
• Title not available (Why is that?)

Cited In (11)

• Title not available (Why is that?)
• Per-spectral characterizations of graphs with extremal per-nullity
• A note on graphs with purely imaginary per-spectrum
• The coefficients of the immanantal polynomial
• Title not available (Why is that?)
• Per-spectral characterizations of some bipartite graphs
• Constructing graphs which are permanental cospectral and adjacency cospectral
• On the matching and permanental polynomials of graphs
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
• The graphs whose permanental polynomials are symmetric
• On the permanental nullity and matching number of graphs

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)