Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
From MaRDI portal
Publication:442233
DOI10.1016/j.dam.2012.04.007zbMath1246.05100arXiv1010.1113OpenAlexW2089593901MaRDI QIDQ442233
Publication date: 10 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.1113
Related Items (27)
On the skew-permanental polynomials of orientation graphs ⋮ Graphs determined by the (signless) Laplacian permanental polynomials ⋮ On the Permanental Polynomial and Permanental Sum of Signed Graphs ⋮ Per-spectral characterizations of some edge-deleted subgraphs of a complete graph ⋮ On the permanental sum of bicyclic graphs ⋮ Per-spectral characterizations of some bipartite graphs ⋮ A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials ⋮ The graphs whose permanental polynomials are symmetric ⋮ On the skew spectra of Cartesian products of graphs ⋮ A note on the permanental roots of bipartite graphs ⋮ Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial ⋮ Computing the permanental polynomials of graphs ⋮ Per-spectral characterizations of graphs with extremal per-nullity ⋮ Constructing graphs which are permanental cospectral and adjacency cospectral ⋮ Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial ⋮ The coefficients of the immanantal polynomial ⋮ Unicyclic graphs with second largest and second smallest permanental sums ⋮ Some extremal graphs with respect to permanental sum ⋮ Enumeration of permanental sums of lattice graphs ⋮ On the permanental nullity and matching number of graphs ⋮ On the matching and permanental polynomials of graphs ⋮ On the permanental polynomials of matrices ⋮ Sharp bounds on the permanental sum of a graph ⋮ Characterizing properties of permanental polynomials of lollipop graphs ⋮ On the normalized Laplacian permanental polynomial of a graph ⋮ On the permanental sum of graphs ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- An efficient algorithm for computing permanental polynomials of graphs
- Matching theory
- Permanental polynomials of graphs
- \(k\)-cycle resonant graphs
- Planar \(k\)-cycle resonant graphs with \(k=1,2\)
- Reducible chains of planar 1-cycle resonant graphs
- Even circuits of prescribed clockwise parity
- Plane elementary bipartite graphs
- A characterization of convertible (0,1)-matrices
- On the permanental polynomials of some graphs
This page was built for publication: Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
