Pages that link to "Item:Q710005"
From MaRDI portal
The following pages link to An efficient algorithm for computing permanental polynomials of graphs (Q710005):
Displayed 11 items.
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation (Q442233) (← links)
- Computing the permanental polynomials of graphs (Q1735410) (← links)
- Constructing graphs which are permanental cospectral and adjacency cospectral (Q1756130) (← links)
- Highly unique network descriptors based on the roots of the permanental polynomial (Q2293292) (← links)
- On the normalized Laplacian permanental polynomial of a graph (Q2330380) (← links)
- A load balancing strategy for parallel computation of sparse permanents (Q2864488) (← links)
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph (Q2938347) (← links)
- Graphs determined by the (signless) Laplacian permanental polynomials (Q5051488) (← links)
- On the permanental nullity and matching number of graphs (Q5206292) (← links)
- Characterizing properties of permanental polynomials of lollipop graphs (Q5495730) (← links)
- A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials (Q6110882) (← links)