Pages that link to "Item:Q1735410"

The following pages link to Computing the permanental polynomials of graphs (Q1735410):

Displaying 16 items.

• An efficient algorithm for computing permanental polynomials of graphs (Q710005) (← links)
• On the (signless) Laplacian permanental polynomials of graphs (Q2000570) (← links)
• The coefficients of the immanantal polynomial (Q2007498) (← links)
• The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs (Q2052128) (← links)
• Further results on the star degree of graphs (Q2139789) (← links)
• Generalized permanental polynomials of graphs (Q2311039) (← links)
• On the normalized Laplacian permanental polynomial of a graph (Q2330380) (← links)
• On the bivariate permanent polynomials of graphs (Q2361557) (← links)
• Some analytical properties of the permanental polynomial of a graph. (Q2828871) (← links)
• The permanental polynomials of certain graphs (Q2856763) (← links)
• Graphs determined by the (signless) Laplacian permanental polynomials (Q5051488) (← links)
• On the Permanental Polynomial and Permanental Sum of Signed Graphs (Q5054779) (← links)
• (Q5396536) (← 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)
• Some unicyclic graphs determined by the signless Laplacian permanental polynomial (Q6586106) (← links)