The following pages link to (Q4827548):
Displaying 9 items.
- An efficient algorithm for computing permanental polynomials of graphs (Q710005) (← links)
- Computing the permanental polynomials of graphs (Q1735410) (← links)
- On the (signless) Laplacian permanental polynomials of graphs (Q2000570) (← links)
- The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs (Q2052128) (← 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)
- (Q4208430) (← links)
- Graphs determined by the (signless) Laplacian permanental polynomials (Q5051488) (← links)
- On the roots of (signless) Laplacian permanental polynomials of graphs (Q6083184) (← links)
