Pages that link to "Item:Q260053"

The following pages link to Per-spectral and adjacency spectral characterizations of a complete graph removing six edges (Q260053):

Displaying 9 items.

• Per-spectral characterizations of bicyclic networks (Q670450) (← links)
• The graphs whose permanental polynomials are symmetric (Q1692645) (← links)
• Computing the permanental polynomials of graphs (Q1735410) (← links)
• Constructing graphs which are permanental cospectral and adjacency cospectral (Q1756130) (← links)
• On the matching and permanental polynomials of graphs (Q2043349) (← 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)
• Per-spectral characterizations of some bipartite graphs (Q2409785) (← links)