Pages that link to "Item:Q1967108"

The following pages link to The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements (Q1967108):

Displaying 10 items.

• On conjugate adjacency matrices of a graph (Q868333) (← links)
• Graphs with a common eigenvalue deck (Q957997) (← links)
• Graph characterising polynomials (Q1304820) (← links)
• The idiosyncratic polynomial of digraphs (Q2155544) (← links)
• On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\) (Q2479499) (← links)
• Reconstructing subgraph-counting graph polynomials of increasing families of graphs (Q2566153) (← links)
• The polynomial reconstruction problem: the first 50 years (Q2699914) (← links)
• (Q3483310) (← links)
• On the characteristic polynomial of the power of a path. (Q4691305) (← links)
• (Q5060665) (← links)