Pages that link to "Item:Q1855397"

The following pages link to Polynomial reconstruction and terminal vertices (Q1855397):

Displaying 14 items.

• Polynomial reconstruction of signed graphs (Q273155) (← links)
• Graphs with a common eigenvalue deck (Q957997) (← 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)
• 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)
• An algorithm to analyse the polynomial deck of the line graph of a triangle-free graph (Q2708243) (← links)
• Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2 (Q2953120) (← links)
• The polynomial reconstruction of unicyclic graphs is unique (Q3422757) (← links)
• (Q3483310) (← links)
• (Q5060665) (← links)
• Reconstruction of a Polynomial from Its Radon Projections (Q5470555) (← links)
• Reconstruction from one labelled card and more (Q6536720) (← links)