Pages that link to "Item:Q2479499"

The following pages link to On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\) (Q2479499):

Displaying 15 items.

• Polynomial reconstruction of signed graphs (Q273155) (← links)
• Graphs with least eigenvalue \(-2\): ten years on (Q491141) (← links)
• Graphs with a common eigenvalue deck (Q957997) (← links)
• Graph characterising polynomials (Q1304820) (← links)
• Polynomial reconstruction and terminal vertices (Q1855397) (← links)
• The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements (Q1967108) (← links)
• Notes on the polynomial reconstruction of signed graphs (Q2134985) (← links)
• Some results on the spectral reconstruction problem (Q2383024) (← links)
• The polynomial reconstruction problem: the first 50 years (Q2699914) (← links)
• An algorithm to analyse the polynomial deck of the line graph of a triangle-free graph (Q2708243) (← links)
• Seeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive results (Q2914004) (← links)
• Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2 (Q2953120) (← links)
• On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices (Q5001714) (← links)
• (Q5060665) (← links)
• Reconstruction from one labelled card and more (Q6536720) (← links)