Permanents of almost regular complete bipartite graphs
From MaRDI portal
Recommendations
Cites work
- An upper bound for the permanent of \((0,1)\)-matrices.
- Characterizing properties of permanental polynomials of lollipop graphs
- Extending the minc-brègman upper bound for the permanent
- Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
- Maximum permanents of matrices of zeros and ones
- On matching coefficients
- On the characterizing properties of the permanental polynomials of graphs
- On the permanental polynomials of some graphs
- Parameterized complexity of determinant and permanent
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- Per-spectral characterizations of graphs with extremal per-nullity
- Per-spectral characterizations of some bipartite graphs
- Permanent, determinant, and rank of bi-block graphs
- Permanental polynomials of graphs
- Permanental sums of graphs of extreme sizes
- Permanents of graphs with cut vertices
- The complexity of computing the permanent
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
This page was built for publication: Permanents of almost regular complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198663)
