Pages that link to "Item:Q1301841"

The following pages link to Maximising the permanent and complementary permanent of (0,1)-matrices with constant line sum (Q1301841):

Displaying 10 items.

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