Permanents of almost regular complete bipartite graphs

DOI10.1080/03081087.2022.2158169OpenAlexW4313401764MaRDI QIDQ6198663

Unnamed Author, Tingzeng Wu

Publication date: 23 February 2024

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2022.2158169

zbMATH Keywords

adjacency matrixpermanentpermanental polynomialrook polynomial

Mathematics Subject Classification ID

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

Cites Work

• Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
• Per-spectral characterizations of graphs with extremal per-nullity
• The complexity of computing the permanent
• Maximum permanents of matrices of zeros and ones
• Permanental polynomials of graphs
• On matching coefficients
• Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum
• An upper bound for the permanent of \((0,1)\)-matrices.
• On the permanental polynomials of some graphs
• On the characterizing properties of the permanental polynomials of graphs
• Permanental sums of graphs of extreme sizes
• Parameterized complexity of determinant and permanent
• Permanent, determinant, and rank of bi-block graphs
• Per-spectral characterizations of some bipartite graphs
• Permanents of graphs with cut vertices
• Extending the minc-brègman upper bound for the permanent
• Characterizing properties of permanental polynomials of lollipop graphs
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices

This page was built for publication: Permanents of almost regular complete bipartite graphs