Pages that link to "Item:Q1072613"
From MaRDI portal
The following pages link to A bound for the permanent of the Laplacian matrix (Q1072613):
Displaying 19 items.
- A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube (Q426914) (← links)
- Permanental bounds of the Laplacian matrix of trees with given domination number (Q497337) (← links)
- New permanental bounds for Ferrers matrices (Q636241) (← links)
- Permanent of the Laplacian matrix of trees with a given matching (Q1107543) (← links)
- Permanents and Lorentzian time-semidefinite matrices (Q1124900) (← links)
- On the geometry and Laplacian of a graph (Q1174690) (← links)
- Laplacian matrices of graphs: A survey (Q1319985) (← links)
- Computing the permanental polynomials of graphs (Q1735410) (← links)
- A remark on approximating permanents of positive definite matrices (Q2226442) (← links)
- Computing the permanent of the Laplacian matrices of nonbipartite graphs (Q2230052) (← links)
- A modified Grassmann algebra approach to theorems on permanents and determinants (Q2273861) (← links)
- On the normalized Laplacian permanental polynomial of a graph (Q2330380) (← links)
- On minors of the compound matrix of a Laplacian (Q2435542) (← links)
- Further results on permanental bounds for the Laplacian matrix of trees (Q3589196) (← links)
- The permanent of the Laplacian matrix of a bipartite graph (Q3739149) (← links)
- Graphs determined by the (signless) Laplacian permanental polynomials (Q5051488) (← links)
- Ordering trees by algebraic connectivity (Q5905368) (← links)
- On the roots of (signless) Laplacian permanental polynomials of graphs (Q6083184) (← links)
- A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials (Q6110882) (← links)
