Pages that link to "Item:Q1932591"

The following pages link to On the characterizing properties of the permanental polynomials of graphs (Q1932591):

Displaying 18 items.

• Per-spectral and adjacency spectral characterizations of a complete graph removing six edges (Q260053) (← links)
• Per-spectral characterizations of graphs with extremal per-nullity (Q491098) (← links)
• Per-spectral characterizations of bicyclic networks (Q670450) (← links)
• Computing the permanental polynomials of graphs (Q1735410) (← links)
• Constructing graphs which are permanental cospectral and adjacency cospectral (Q1756130) (← links)
• On the (signless) Laplacian permanental polynomials of graphs (Q2000570) (← 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)
• On the permanental sum of graphs (Q2333188) (← links)
• On the bivariate permanent polynomials of graphs (Q2361557) (← links)
• Per-spectral characterizations of some bipartite graphs (Q2409785) (← links)
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph (Q2938347) (← links)
• (Q4208430) (← 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 note on graphs with purely imaginary per-spectrum (Q6571006) (← links)