Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
Authors:
- Heping ZhangHZHeping Zhang
- Wei LiWLWei Li
- 1 September 2012
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 160 (13-14) , 2069-2074
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- An efficient algorithm for computing permanental polynomials of graphsComputer Physics Communications, 2006
- On the Permanental Polynomials of Some GraphsJournal of Mathematical Chemistry, 2004
- Reducible chains of planar 1-cycle resonant graphsDiscrete Mathematics, 2004
- Planar k-cycle resonant graphs with k=1,2Discrete Applied Mathematics, 2003
- Plane elementary bipartite graphsDiscrete Applied Mathematics, 2000
- The Permanental PolynomialJournal of Chemical Information and Computer Sciences, 2000
- k-Cycle resonant graphsDiscrete Mathematics, 1994
- Permanental polynomials of graphsLinear Algebra and its Applications, 1981
- The complexity of computing the permanentTheoretical Computer Science, 1979
- A characterization of convertible (0, 1)-matricesJournal of Combinatorial Theory, Series B, 1975