Pages that link to "Item:Q1970575"

The following pages link to On the reconstruction of the characteristic polynomial of a graph (Q1970575):

Displaying 17 items.

• Polynomial reconstruction of signed graphs (Q273155) (← 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)
• The idiosyncratic polynomial of digraphs (Q2155544) (← links)
• On reconstruction of eigenfunctions of Johnson graphs (Q2309565) (← links)
• On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\) (Q2479499) (← links)
• Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems (Q2583663) (← links)
• The polynomial reconstruction problem: the first 50 years (Q2699914) (← 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)
• The polynomial reconstruction of unicyclic graphs is unique (Q3422757) (← links)
• (Q4443927) (← links)
• (Q5060665) (← links)
• On formal products and angle matrices of a graph (Q5957703) (← links)
• Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs (Q6151923) (← links)
• Reconstruction from one labelled card and more (Q6536720) (← links)
• Singularity of cycle-spliced signed graphs (Q6587022) (← links)