Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum

DOI10.1016/S0012-365X(99)00048-5zbMath0952.15007WikidataQ127884386 ScholiaQ127884386MaRDI QIDQ1301841

Ian M. Wanless

Publication date: 3 January 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

permanents\((0,1)\)-matricesenumeration problemsregular bipartite graphsrook polynomials

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Miscellaneous inequalities involving matrices (15A45) Matrices of integers (15B36)

Related Items

Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\) ⋮ Permanents of almost regular complete bipartite graphs ⋮ A lower bound on the maximum permanent in \(\Lambda_{n}^{k}\). ⋮ Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges ⋮ Permanental bounds of the Laplacian matrix of trees with given domination number ⋮ An update on Minc's survey of open problems involving permanents ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices ⋮ On the number of Sudoku squares ⋮ Counting Matchings and Tree-Like Walks in Regular Graphs ⋮ Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs ⋮ On Minc's sixth Conjecture

Cites Work

• Maximum permanents of matrices of zeros and ones
• Hermite polynomials and a duality relation for matchings polynomials
• Maximising the permanent of \((0,1)\)-matrices and the number of extensions of Latin rectangles
• Counting 1-factors in regular bipartite graphs
• The maximum permanent in
• Theory of permanents 1978–1981
• Asymptotic enumeration of Latin rectangles
• Unnamed Item
• Unnamed Item