Polynomial reconstruction problem for hypergraphs
From MaRDI portal
Publication:6496383
DOI10.1016/J.LAA.2024.03.029MaRDI QIDQ6496383
Publication date: 3 May 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Graph polynomials (05C31) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of uniform hypergraphs
- A congruence theorem for trees
- A family of non-reconstructible hypergraphs
- Recent results in the theory of graph spectra
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- The polynomial reconstruction problem: the first 50 years
This page was built for publication: Polynomial reconstruction problem for hypergraphs