Reconstruction from one labelled card and more

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex degrees (05C07) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Chemical graph theory (05C92)

Recommendations

Reconstructing graphs from a deck of all distinct cards
Graphs with a common eigenvalue deck
Reconstruction number for Ulam's conjecture.
Reconstructibility of the \(K_r\)-count from \(n - 1\) cards
Families of pairs of graphs with a large number of common cards

Cites work

scientific article; zbMATH DE number 3141308 (Why is no real title available?)
scientific article; zbMATH DE number 3739586 (Why is no real title available?)
scientific article; zbMATH DE number 1248194 (Why is no real title available?)
scientific article; zbMATH DE number 510845 (Why is no real title available?)
scientific article; zbMATH DE number 2028636 (Why is no real title available?)
scientific article; zbMATH DE number 2061158 (Why is no real title available?)
A characterization of singular graphs
A congruence theorem for trees
A graph polynomial and its applications
Almost every graph has reconstruction number three
Charting the space of chemical nut graphs
Coalesced and embedded nut graphs in singular graphs
Coalescing Fiedler and core vertices.
Constructing trees with given eigenvalues and angles
Eigenspaces of graphs
Existence of regular nut graphs for degree at most 11
Generation and properties of nut graphs
Graphs with a common eigenvalue deck
Interlacing-extremal graphs
Minimum-rank matrices with prescribed graph
On 12-regular nut graphs
On nut and core singular fullerenes
On the Eigenvalues and Eigenvectors of a Class of Matrices
On the displacement of eigenvalues when removing a twin vertex
On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)
On the reconstruction of the characteristic polynomial of a graph
Polynomial reconstruction and terminal vertices
Seeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive results
The graph reconstruction number
The polynomial reconstruction problem: the first 50 years

Cited in

(1)

Reconstructibility of the \(K_r\)-count from \(n - 1\) cards

This page was built for publication: Reconstruction from one labelled card and more

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536720)