Pages that link to "Item:Q2293292"
From MaRDI portal
The following pages link to Highly unique network descriptors based on the roots of the permanental polynomial (Q2293292):
Displaying 9 items.
- The coefficients of the immanantal polynomial (Q2007498) (← links)
- Unicyclic graphs with second largest and second smallest permanental sums (Q2010574) (← links)
- Permanental sums of graphs of extreme sizes (Q2022135) (← links)
- Sharp bounds on the permanental sum of a graph (Q2053704) (← links)
- Further results on the star degree of graphs (Q2139789) (← links)
- On the permanental sum of bicyclic graphs (Q2176222) (← links)
- Graph measures with high discrimination power revisited: a random polynomial approach (Q2200600) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- Generalized permanental polynomials of graphs (Q2311039) (← links)
