Polynomial reconstruction problem for hypergraphs

DOI10.1016/J.LAA.2024.03.029MaRDI QIDQ6496383zbMATH OpenFDO

Authors Joshua Cooper, Utku Okur

Publication date 3 May 2024

Published in Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

reconstructionspectrumhypergraphpolynomialcharacteristic

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 2061158
• On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\)
• The polynomial reconstruction problem: the first 50 years
• scientific article; zbMATH DE number 125495
• Polynomial reconstruction and terminal vertices

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 3769666 (Why is no real title available?)
• A congruence theorem for trees
• A family of non-reconstructible hypergraphs
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Recent results in the theory of graph spectra
• Spectra of uniform hypergraphs
• The polynomial reconstruction problem: the first 50 years

Cited in

(2)

• Weighted 2-sections and hypergraph reconstruction
• The generalized microscopic image reconstruction problem for hypergraphs

Describes a project that uses

This page was built for publication: Polynomial reconstruction problem for hypergraphs

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