The following pages link to (Q5299380):
Displaying 9 items.
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges (Q260053) (← links)
- Computing the permanental polynomials of graphs (Q1735410) (← links)
- On the (signless) Laplacian permanental polynomials of graphs (Q2000570) (← links)
- Enumeration of permanental sums of lattice graphs (Q2287623) (← links)
- Highly unique network descriptors based on the roots of the permanental polynomial (Q2293292) (← links)
- Generalized permanental polynomials of graphs (Q2311039) (← links)
- On the normalized Laplacian permanental polynomial of a graph (Q2330380) (← links)
- Graphs determined by the (signless) Laplacian permanental polynomials (Q5051488) (← links)
- A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials (Q6110882) (← links)