Pages that link to "Item:Q2938347"

The following pages link to Per-spectral characterizations of some edge-deleted subgraphs of a complete graph (Q2938347):

Displayed 19 items.

• Per-spectral and adjacency spectral characterizations of a complete graph removing six edges (Q260053) ‎ (← links)
• On the skew-permanental polynomials of orientation graphs (Q284839) ‎ (← links)
• Per-spectral characterizations of graphs with extremal per-nullity (Q491098) ‎ (← links)
• 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)
• The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs (Q2052128) ‎ (← links)
• Sharp bounds on the permanental sum of a graph (Q2053704) ‎ (← links)
• \( A_\alpha\)-spectral characterizations of some joins (Q2228188) ‎ (← 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)
• Graphs determined by the (signless) Laplacian permanental polynomials (Q5051488) ‎ (← links)
• On the Permanental Polynomial and Permanental Sum of Signed Graphs (Q5054779) ‎ (← links)
• On the permanental nullity and matching number of graphs (Q5206292) ‎ (← links)
• A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials (Q6110882) ‎ (← links)